/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loops/insertion_sort-2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:07:17,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:07:17,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 22:07:17,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:07:17,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:07:17,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:07:17,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:07:17,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:07:17,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:07:17,584 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:07:17,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:07:17,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:07:17,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:07:17,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:07:17,586 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:07:17,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:07:17,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:07:17,586 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:07:17,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:07:17,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:07:17,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:07:17,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:07:17,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:07:17,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:07:17,588 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:07:17,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:07:17,588 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:07:17,588 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:07:17,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:07:17,588 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:07:17,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:07:17,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:07:17,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:07:17,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:07:17,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:07:17,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:07:17,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:07:17,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:07:17,590 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:07:17,590 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:07:17,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:07:17,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:07:17,592 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:07:17,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:07:17,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:07:17,592 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:07:17,592 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 22:07:17,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:07:17,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:07:17,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:07:17,794 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:07:17,795 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:07:17,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-2-2.c [2023-12-24 22:07:18,898 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:07:19,054 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:07:19,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2-2.c [2023-12-24 22:07:19,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e195350/f885ea748e774b8ebbe4bba0c18f8e56/FLAGa4a7de36d [2023-12-24 22:07:19,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e195350/f885ea748e774b8ebbe4bba0c18f8e56 [2023-12-24 22:07:19,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:07:19,073 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:07:19,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:07:19,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:07:19,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:07:19,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51289897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19, skipping insertion in model container [2023-12-24 22:07:19,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,094 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:07:19,194 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2-2.c[330,343] [2023-12-24 22:07:19,211 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:07:19,219 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:07:19,227 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2-2.c[330,343] [2023-12-24 22:07:19,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:07:19,244 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:07:19,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19 WrapperNode [2023-12-24 22:07:19,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:07:19,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:07:19,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:07:19,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:07:19,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,275 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2023-12-24 22:07:19,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:07:19,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:07:19,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:07:19,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:07:19,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,296 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2023-12-24 22:07:19,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:07:19,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:07:19,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:07:19,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:07:19,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (1/1) ... [2023-12-24 22:07:19,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:07:19,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:07:19,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 22:07:19,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 22:07:19,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:07:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:07:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 22:07:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 22:07:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 22:07:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 22:07:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:07:19,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:07:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 22:07:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 22:07:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 22:07:19,471 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:07:19,473 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:07:19,658 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:07:19,681 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:07:19,681 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-24 22:07:19,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:07:19 BoogieIcfgContainer [2023-12-24 22:07:19,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:07:19,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:07:19,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:07:19,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:07:19,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:07:19" (1/3) ... [2023-12-24 22:07:19,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322d5cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:07:19, skipping insertion in model container [2023-12-24 22:07:19,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:19" (2/3) ... [2023-12-24 22:07:19,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322d5cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:07:19, skipping insertion in model container [2023-12-24 22:07:19,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:07:19" (3/3) ... [2023-12-24 22:07:19,688 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort-2-2.c [2023-12-24 22:07:19,701 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:07:19,701 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:07:19,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:07:19,742 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6091298a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:07:19,743 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:07:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 22:07:19,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:19,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:19,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:19,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash 438010954, now seen corresponding path program 1 times [2023-12-24 22:07:19,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:19,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142203681] [2023-12-24 22:07:19,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:19,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:19,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:19,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:19,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 22:07:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:19,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 22:07:19,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:19,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:19,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142203681] [2023-12-24 22:07:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142203681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:19,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:19,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 22:07:19,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357906171] [2023-12-24 22:07:19,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:19,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 22:07:19,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:19,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 22:07:19,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 22:07:19,866 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:19,888 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2023-12-24 22:07:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 22:07:19,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 22:07:19,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:19,896 INFO L225 Difference]: With dead ends: 33 [2023-12-24 22:07:19,896 INFO L226 Difference]: Without dead ends: 15 [2023-12-24 22:07:19,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 22:07:19,900 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:19,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-24 22:07:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-24 22:07:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2023-12-24 22:07:19,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2023-12-24 22:07:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:19,923 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-12-24 22:07:19,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2023-12-24 22:07:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 22:07:19,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:19,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:19,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:20,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:20,127 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:20,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash -616055382, now seen corresponding path program 1 times [2023-12-24 22:07:20,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:20,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572602814] [2023-12-24 22:07:20,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:20,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:20,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:20,131 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:20,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 22:07:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:20,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:07:20,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:20,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:20,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:20,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572602814] [2023-12-24 22:07:20,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572602814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:20,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:20,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 22:07:20,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380179755] [2023-12-24 22:07:20,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:20,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 22:07:20,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 22:07:20,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:07:20,249 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:20,382 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2023-12-24 22:07:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 22:07:20,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 22:07:20,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:20,392 INFO L225 Difference]: With dead ends: 31 [2023-12-24 22:07:20,392 INFO L226 Difference]: Without dead ends: 16 [2023-12-24 22:07:20,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 22:07:20,395 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:20,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:07:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-24 22:07:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-24 22:07:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-12-24 22:07:20,405 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2023-12-24 22:07:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:20,406 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-12-24 22:07:20,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-12-24 22:07:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-24 22:07:20,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:20,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:20,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:20,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:20,610 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:20,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash -506871303, now seen corresponding path program 1 times [2023-12-24 22:07:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:20,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175819523] [2023-12-24 22:07:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:20,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:20,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:20,613 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:20,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 22:07:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:20,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:07:20,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:20,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:20,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:20,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175819523] [2023-12-24 22:07:20,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175819523] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:20,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:20,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-24 22:07:20,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536669825] [2023-12-24 22:07:20,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:20,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 22:07:20,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:20,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 22:07:20,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-24 22:07:20,864 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:20,980 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-12-24 22:07:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 22:07:20,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-24 22:07:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:20,981 INFO L225 Difference]: With dead ends: 35 [2023-12-24 22:07:20,981 INFO L226 Difference]: Without dead ends: 18 [2023-12-24 22:07:20,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-12-24 22:07:20,982 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:20,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 54 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:07:20,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-24 22:07:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-24 22:07:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-24 22:07:20,985 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-12-24 22:07:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:20,985 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-24 22:07:20,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-24 22:07:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-24 22:07:20,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:20,985 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:20,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 22:07:21,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:21,186 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:21,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash -232251245, now seen corresponding path program 1 times [2023-12-24 22:07:21,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29452996] [2023-12-24 22:07:21,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:21,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:21,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:21,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:07:21,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 22:07:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:21,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 22:07:21,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:21,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 22:07:21,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-24 22:07:21,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:21,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2023-12-24 22:07:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:07:21,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 22:07:22,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:22,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29452996] [2023-12-24 22:07:22,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29452996] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:22,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:22,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-24 22:07:22,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400974934] [2023-12-24 22:07:22,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:22,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 22:07:22,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:22,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 22:07:22,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-24 22:07:22,098 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:07:27,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:07:31,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:07:35,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:07:39,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:07:43,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:07:47,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:07:51,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:07:56,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:00,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:04,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:08,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:13,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:17,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:21,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:25,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:08:25,084 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2023-12-24 22:08:25,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 22:08:25,084 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-24 22:08:25,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:08:25,087 INFO L225 Difference]: With dead ends: 74 [2023-12-24 22:08:25,087 INFO L226 Difference]: Without dead ends: 63 [2023-12-24 22:08:25,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 22:08:25,088 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 149 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 20 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:08:25,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 108 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 257 Invalid, 15 Unknown, 0 Unchecked, 61.0s Time] [2023-12-24 22:08:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-24 22:08:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 30. [2023-12-24 22:08:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-12-24 22:08:25,112 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 16 [2023-12-24 22:08:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:08:25,112 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-12-24 22:08:25,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-12-24 22:08:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 22:08:25,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:08:25,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:08:25,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 22:08:25,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:25,314 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:08:25,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:08:25,314 INFO L85 PathProgramCache]: Analyzing trace with hash 200630979, now seen corresponding path program 1 times [2023-12-24 22:08:25,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:08:25,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985445089] [2023-12-24 22:08:25,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:08:25,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:25,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:08:25,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:08:25,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 22:08:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:08:25,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 22:08:25,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:08:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:08:25,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:08:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:08:25,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:08:25,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985445089] [2023-12-24 22:08:25,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985445089] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:08:25,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:08:25,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-24 22:08:25,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721400587] [2023-12-24 22:08:25,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:08:25,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 22:08:25,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:08:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 22:08:25,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-24 22:08:25,649 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:08:25,992 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2023-12-24 22:08:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 22:08:25,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-24 22:08:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:08:25,995 INFO L225 Difference]: With dead ends: 96 [2023-12-24 22:08:25,995 INFO L226 Difference]: Without dead ends: 64 [2023-12-24 22:08:25,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2023-12-24 22:08:25,996 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:08:25,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 83 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 22:08:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-24 22:08:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2023-12-24 22:08:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2023-12-24 22:08:26,021 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 19 [2023-12-24 22:08:26,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:08:26,022 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2023-12-24 22:08:26,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2023-12-24 22:08:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-24 22:08:26,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:08:26,023 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:08:26,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 22:08:26,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:26,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:08:26,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:08:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1013208659, now seen corresponding path program 1 times [2023-12-24 22:08:26,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:08:26,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901572891] [2023-12-24 22:08:26,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:08:26,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:26,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:08:26,228 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:08:26,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 22:08:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:08:26,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:08:26,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:08:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 22:08:26,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:08:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 22:08:26,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:08:26,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901572891] [2023-12-24 22:08:26,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901572891] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:08:26,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:08:26,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-12-24 22:08:26,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302584748] [2023-12-24 22:08:26,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:08:26,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 22:08:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:08:26,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 22:08:26,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-24 22:08:26,363 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:08:26,491 INFO L93 Difference]: Finished difference Result 84 states and 111 transitions. [2023-12-24 22:08:26,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 22:08:26,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-24 22:08:26,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:08:26,492 INFO L225 Difference]: With dead ends: 84 [2023-12-24 22:08:26,492 INFO L226 Difference]: Without dead ends: 40 [2023-12-24 22:08:26,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-24 22:08:26,493 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:08:26,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 56 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:08:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-24 22:08:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2023-12-24 22:08:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:26,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-12-24 22:08:26,499 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 22 [2023-12-24 22:08:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:08:26,499 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-12-24 22:08:26,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-12-24 22:08:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 22:08:26,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:08:26,499 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:08:26,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 22:08:26,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:26,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:08:26,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:08:26,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1154291357, now seen corresponding path program 2 times [2023-12-24 22:08:26,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:08:26,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624867594] [2023-12-24 22:08:26,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:08:26,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:26,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:08:26,704 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:08:26,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 22:08:26,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:08:26,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:08:26,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 22:08:26,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:08:26,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 22:08:26,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-24 22:08:27,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:27,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2023-12-24 22:08:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:08:27,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:08:27,927 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2023-12-24 22:08:27,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 72 [2023-12-24 22:08:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 22:08:28,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:08:28,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624867594] [2023-12-24 22:08:28,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624867594] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:08:28,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:08:28,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-12-24 22:08:28,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537754440] [2023-12-24 22:08:28,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:08:28,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 22:08:28,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:08:28,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 22:08:28,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2023-12-24 22:08:28,071 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:33,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:34,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:38,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:42,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:47,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:08:52,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:08:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:08:53,488 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2023-12-24 22:08:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-24 22:08:53,491 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-24 22:08:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:08:53,494 INFO L225 Difference]: With dead ends: 116 [2023-12-24 22:08:53,495 INFO L226 Difference]: Without dead ends: 114 [2023-12-24 22:08:53,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=589, Invalid=2167, Unknown=0, NotChecked=0, Total=2756 [2023-12-24 22:08:53,497 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 269 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 20 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2023-12-24 22:08:53,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 179 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 390 Invalid, 4 Unknown, 0 Unchecked, 22.3s Time] [2023-12-24 22:08:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-24 22:08:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 68. [2023-12-24 22:08:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2023-12-24 22:08:53,518 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 25 [2023-12-24 22:08:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:08:53,519 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2023-12-24 22:08:53,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:08:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2023-12-24 22:08:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 22:08:53,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:08:53,519 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:08:53,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 22:08:53,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:53,723 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:08:53,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:08:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1558087961, now seen corresponding path program 2 times [2023-12-24 22:08:53,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:08:53,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948038374] [2023-12-24 22:08:53,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:08:53,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:08:53,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:08:53,726 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:08:53,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 22:08:53,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:08:53,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:08:53,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-24 22:08:53,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:08:53,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 22:08:53,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-24 22:08:54,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:54,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22 [2023-12-24 22:08:54,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:54,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2023-12-24 22:08:54,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:54,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 25 [2023-12-24 22:08:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 22:08:54,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:08:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 22:08:56,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:08:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948038374] [2023-12-24 22:08:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948038374] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:08:56,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:08:56,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2023-12-24 22:08:56,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681202317] [2023-12-24 22:08:56,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:08:56,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-24 22:08:56,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:08:56,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-24 22:08:56,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2023-12-24 22:08:56,184 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:09:01,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:09:05,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:09:09,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:09:13,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:09:17,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:09:21,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:09:25,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:09:29,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:09:33,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:09:38,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:09:46,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:09:54,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:02,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:13,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:16,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:24,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:28,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:32,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:36,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:40,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:45,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:49,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:53,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:10:57,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:01,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:13,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:11:17,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:11:22,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:26,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:11:29,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:33,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:38,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:42,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:46,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:50,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:54,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:11:59,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:04,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:11,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:15,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:19,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:23,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:27,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:12:31,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:35,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:39,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:43,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:48,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:52,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:12:57,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:13:07,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:13:11,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:13:15,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:13:19,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:13:23,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:13:27,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:13:31,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:13:36,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:13:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:13:39,184 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2023-12-24 22:13:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-12-24 22:13:39,185 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-24 22:13:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:13:39,185 INFO L225 Difference]: With dead ends: 189 [2023-12-24 22:13:39,185 INFO L226 Difference]: Without dead ends: 187 [2023-12-24 22:13:39,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2205 ImplicationChecksByTransitivity, 46.4s TimeCoverageRelationStatistics Valid=1246, Invalid=5560, Unknown=0, NotChecked=0, Total=6806 [2023-12-24 22:13:39,187 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 422 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 62 mSolverCounterUnsat, 55 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 237.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 55 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 238.3s IncrementalHoareTripleChecker+Time [2023-12-24 22:13:39,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 188 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 553 Invalid, 55 Unknown, 0 Unchecked, 238.3s Time] [2023-12-24 22:13:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-24 22:13:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 89. [2023-12-24 22:13:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2023-12-24 22:13:39,206 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 25 [2023-12-24 22:13:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:13:39,206 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2023-12-24 22:13:39,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2023-12-24 22:13:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-24 22:13:39,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:13:39,210 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:13:39,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-24 22:13:39,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:13:39,413 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:13:39,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:13:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash 979684279, now seen corresponding path program 1 times [2023-12-24 22:13:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:13:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569199105] [2023-12-24 22:13:39,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:13:39,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:13:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:13:39,415 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:13:39,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 22:13:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:13:39,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 22:13:39,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:13:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-24 22:13:39,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:13:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-24 22:13:39,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:13:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569199105] [2023-12-24 22:13:39,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569199105] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:13:39,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:13:39,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-12-24 22:13:39,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276185217] [2023-12-24 22:13:39,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:13:39,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 22:13:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:13:39,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 22:13:39,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-24 22:13:39,592 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:13:40,000 INFO L93 Difference]: Finished difference Result 253 states and 328 transitions. [2023-12-24 22:13:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 22:13:40,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-24 22:13:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:13:40,002 INFO L225 Difference]: With dead ends: 253 [2023-12-24 22:13:40,002 INFO L226 Difference]: Without dead ends: 177 [2023-12-24 22:13:40,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2023-12-24 22:13:40,003 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 137 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:13:40,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 95 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 22:13:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-24 22:13:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 102. [2023-12-24 22:13:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2023-12-24 22:13:40,039 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 28 [2023-12-24 22:13:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:13:40,040 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2023-12-24 22:13:40,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2023-12-24 22:13:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 22:13:40,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:13:40,041 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:13:40,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 22:13:40,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:13:40,241 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:13:40,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:13:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1194033466, now seen corresponding path program 1 times [2023-12-24 22:13:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:13:40,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360638671] [2023-12-24 22:13:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:13:40,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:13:40,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:13:40,246 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:13:40,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 22:13:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:13:40,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:13:40,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:13:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 22:13:40,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:13:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 22:13:40,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:13:40,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360638671] [2023-12-24 22:13:40,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360638671] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:13:40,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:13:40,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-24 22:13:40,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787692211] [2023-12-24 22:13:40,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:13:40,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 22:13:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:13:40,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 22:13:40,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-12-24 22:13:40,632 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:13:41,898 INFO L93 Difference]: Finished difference Result 326 states and 406 transitions. [2023-12-24 22:13:41,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-24 22:13:41,898 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-24 22:13:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:13:41,899 INFO L225 Difference]: With dead ends: 326 [2023-12-24 22:13:41,899 INFO L226 Difference]: Without dead ends: 300 [2023-12-24 22:13:41,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=423, Invalid=1217, Unknown=0, NotChecked=0, Total=1640 [2023-12-24 22:13:41,901 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 525 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 22:13:41,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 169 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 22:13:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-24 22:13:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 145. [2023-12-24 22:13:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 144 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 192 transitions. [2023-12-24 22:13:41,928 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 192 transitions. Word has length 30 [2023-12-24 22:13:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:13:41,928 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 192 transitions. [2023-12-24 22:13:41,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 192 transitions. [2023-12-24 22:13:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 22:13:41,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:13:41,929 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:13:41,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-24 22:13:42,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:13:42,133 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:13:42,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:13:42,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1496647193, now seen corresponding path program 1 times [2023-12-24 22:13:42,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:13:42,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335987844] [2023-12-24 22:13:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:13:42,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:13:42,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:13:42,134 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:13:42,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 22:13:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:13:42,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 22:13:42,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:13:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-24 22:13:42,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:13:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-24 22:13:43,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:13:43,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335987844] [2023-12-24 22:13:43,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335987844] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:13:43,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:13:43,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-24 22:13:43,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685312025] [2023-12-24 22:13:43,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:13:43,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 22:13:43,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:13:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 22:13:43,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-12-24 22:13:43,026 INFO L87 Difference]: Start difference. First operand 145 states and 192 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:44,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:13:44,057 INFO L93 Difference]: Finished difference Result 329 states and 423 transitions. [2023-12-24 22:13:44,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 22:13:44,059 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-24 22:13:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:13:44,059 INFO L225 Difference]: With dead ends: 329 [2023-12-24 22:13:44,059 INFO L226 Difference]: Without dead ends: 193 [2023-12-24 22:13:44,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2023-12-24 22:13:44,062 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 112 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 22:13:44,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 168 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 22:13:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-24 22:13:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2023-12-24 22:13:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.302857142857143) internal successors, (228), 175 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 228 transitions. [2023-12-24 22:13:44,144 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 228 transitions. Word has length 31 [2023-12-24 22:13:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:13:44,144 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 228 transitions. [2023-12-24 22:13:44,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 228 transitions. [2023-12-24 22:13:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 22:13:44,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:13:44,145 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:13:44,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 22:13:44,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:13:44,348 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:13:44,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:13:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash -474202787, now seen corresponding path program 2 times [2023-12-24 22:13:44,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:13:44,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154067078] [2023-12-24 22:13:44,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:13:44,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:13:44,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:13:44,350 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:13:44,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 22:13:44,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:13:44,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:13:44,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:13:44,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:13:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 22:13:44,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:13:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 22:13:44,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:13:44,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154067078] [2023-12-24 22:13:44,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154067078] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:13:44,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:13:44,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-24 22:13:44,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264441889] [2023-12-24 22:13:44,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:13:44,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 22:13:44,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:13:44,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 22:13:44,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-24 22:13:44,674 INFO L87 Difference]: Start difference. First operand 176 states and 228 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:13:45,129 INFO L93 Difference]: Finished difference Result 277 states and 360 transitions. [2023-12-24 22:13:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 22:13:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-24 22:13:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:13:45,130 INFO L225 Difference]: With dead ends: 277 [2023-12-24 22:13:45,130 INFO L226 Difference]: Without dead ends: 159 [2023-12-24 22:13:45,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2023-12-24 22:13:45,131 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 76 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 22:13:45,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 110 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 22:13:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-24 22:13:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2023-12-24 22:13:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.269736842105263) internal successors, (193), 152 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 193 transitions. [2023-12-24 22:13:45,153 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 193 transitions. Word has length 31 [2023-12-24 22:13:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:13:45,153 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 193 transitions. [2023-12-24 22:13:45,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 193 transitions. [2023-12-24 22:13:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 22:13:45,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:13:45,154 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:13:45,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 22:13:45,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:13:45,357 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:13:45,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:13:45,357 INFO L85 PathProgramCache]: Analyzing trace with hash 226861791, now seen corresponding path program 1 times [2023-12-24 22:13:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:13:45,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345302443] [2023-12-24 22:13:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:13:45,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:13:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:13:45,358 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:13:45,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 22:13:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:13:45,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 22:13:45,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:13:45,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 22:13:45,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-24 22:13:45,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:13:45,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2023-12-24 22:13:45,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:13:45,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 29 [2023-12-24 22:13:45,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:13:45,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 22 [2023-12-24 22:13:46,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:13:46,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2023-12-24 22:13:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 22:13:46,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:13:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 22:13:51,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:13:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345302443] [2023-12-24 22:13:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345302443] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:13:51,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:13:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2023-12-24 22:13:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114891786] [2023-12-24 22:13:51,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:13:51,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-24 22:13:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:13:51,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-24 22:13:51,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2023-12-24 22:13:51,331 INFO L87 Difference]: Start difference. First operand 153 states and 193 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:13:56,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:14:04,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:08,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:12,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:17,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:21,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:25,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:36,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:40,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:44,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:48,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:14:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:14:52,683 INFO L93 Difference]: Finished difference Result 195 states and 238 transitions. [2023-12-24 22:14:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-24 22:14:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-24 22:14:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:14:52,684 INFO L225 Difference]: With dead ends: 195 [2023-12-24 22:14:52,684 INFO L226 Difference]: Without dead ends: 147 [2023-12-24 22:14:52,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=334, Invalid=1922, Unknown=0, NotChecked=0, Total=2256 [2023-12-24 22:14:52,685 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 100 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 15 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.5s IncrementalHoareTripleChecker+Time [2023-12-24 22:14:52,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 198 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 447 Invalid, 10 Unknown, 0 Unchecked, 45.5s Time] [2023-12-24 22:14:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-24 22:14:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2023-12-24 22:14:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:14:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 161 transitions. [2023-12-24 22:14:52,703 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 161 transitions. Word has length 31 [2023-12-24 22:14:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:14:52,703 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 161 transitions. [2023-12-24 22:14:52,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:14:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 161 transitions. [2023-12-24 22:14:52,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 22:14:52,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:14:52,703 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:14:52,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-24 22:14:52,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:14:52,911 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:14:52,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:14:52,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1709509395, now seen corresponding path program 3 times [2023-12-24 22:14:52,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:14:52,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605611912] [2023-12-24 22:14:52,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:14:52,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:14:52,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:14:52,914 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:14:52,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-24 22:14:52,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 22:14:52,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:14:52,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-24 22:14:53,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:14:53,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 22:14:53,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2023-12-24 22:14:54,645 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:14:54,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:14:54,659 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:14:54,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:14:54,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 27 [2023-12-24 22:14:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 22:14:54,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:14:56,959 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2023-12-24 22:14:56,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2023-12-24 22:15:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 22:15:03,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:15:03,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605611912] [2023-12-24 22:15:03,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605611912] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:15:03,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:15:03,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2023-12-24 22:15:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57289295] [2023-12-24 22:15:03,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:15:03,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-24 22:15:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:15:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-24 22:15:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=967, Unknown=1, NotChecked=0, Total=1190 [2023-12-24 22:15:03,131 INFO L87 Difference]: Start difference. First operand 124 states and 161 transitions. Second operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:15:09,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:15:15,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:15:22,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:15:28,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:15:34,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:15:38,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:15:39,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:15:43,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:15:47,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:15:51,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:15:55,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:16:00,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:16:09,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:16:13,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:16:17,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:16:21,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:16:25,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:16:29,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:16:37,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:16:42,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:16:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:16:53,484 INFO L93 Difference]: Finished difference Result 365 states and 458 transitions. [2023-12-24 22:16:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-12-24 22:16:53,484 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-24 22:16:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:16:53,485 INFO L225 Difference]: With dead ends: 365 [2023-12-24 22:16:53,485 INFO L226 Difference]: Without dead ends: 298 [2023-12-24 22:16:53,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4353 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=3135, Invalid=12115, Unknown=2, NotChecked=0, Total=15252 [2023-12-24 22:16:53,488 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 696 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 121 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:16:53,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 229 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 706 Invalid, 19 Unknown, 0 Unchecked, 82.2s Time] [2023-12-24 22:16:53,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-24 22:16:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 188. [2023-12-24 22:16:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2566844919786095) internal successors, (235), 187 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:16:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 235 transitions. [2023-12-24 22:16:53,537 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 235 transitions. Word has length 34 [2023-12-24 22:16:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:16:53,538 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 235 transitions. [2023-12-24 22:16:53,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:16:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 235 transitions. [2023-12-24 22:16:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 22:16:53,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:16:53,538 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:16:53,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-24 22:16:53,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:16:53,740 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:16:53,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:16:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1563013495, now seen corresponding path program 3 times [2023-12-24 22:16:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:16:53,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507123229] [2023-12-24 22:16:53,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:16:53,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:16:53,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:16:53,742 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:16:53,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-24 22:16:53,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-24 22:16:53,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:16:53,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-24 22:16:53,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:16:54,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-24 22:16:54,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2023-12-24 22:16:55,529 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:16:55,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:16:55,532 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:16:55,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:16:55,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 27 [2023-12-24 22:16:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 22:16:55,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:16:57,070 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2023-12-24 22:16:57,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2023-12-24 22:16:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 22:16:58,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:16:58,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507123229] [2023-12-24 22:16:58,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507123229] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:16:58,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:16:58,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-12-24 22:16:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682440070] [2023-12-24 22:16:58,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:16:58,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-24 22:16:58,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:16:58,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-24 22:16:58,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=815, Unknown=0, NotChecked=0, Total=992 [2023-12-24 22:16:58,925 INFO L87 Difference]: Start difference. First operand 188 states and 235 transitions. Second operand has 32 states, 32 states have (on average 1.75) internal successors, (56), 32 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:17:16,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:17:17,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:17:21,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:17:25,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:17:29,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:17:33,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:17:40,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:17:42,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:17:46,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:17:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:17:52,801 INFO L93 Difference]: Finished difference Result 308 states and 366 transitions. [2023-12-24 22:17:52,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-12-24 22:17:52,802 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.75) internal successors, (56), 32 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-24 22:17:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:17:52,803 INFO L225 Difference]: With dead ends: 308 [2023-12-24 22:17:52,803 INFO L226 Difference]: Without dead ends: 306 [2023-12-24 22:17:52,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2644 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=1880, Invalid=8220, Unknown=0, NotChecked=0, Total=10100 [2023-12-24 22:17:52,805 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 471 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 85 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.8s IncrementalHoareTripleChecker+Time [2023-12-24 22:17:52,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 339 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 983 Invalid, 7 Unknown, 0 Unchecked, 37.8s Time] [2023-12-24 22:17:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-12-24 22:17:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 200. [2023-12-24 22:17:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.256281407035176) internal successors, (250), 199 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:17:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 250 transitions. [2023-12-24 22:17:52,869 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 250 transitions. Word has length 34 [2023-12-24 22:17:52,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:17:52,870 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 250 transitions. [2023-12-24 22:17:52,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.75) internal successors, (56), 32 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:17:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 250 transitions. [2023-12-24 22:17:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 22:17:52,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:17:52,871 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:17:52,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-24 22:17:53,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:17:53,074 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:17:53,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:17:53,075 INFO L85 PathProgramCache]: Analyzing trace with hash 19574483, now seen corresponding path program 3 times [2023-12-24 22:17:53,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:17:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531430313] [2023-12-24 22:17:53,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:17:53,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:17:53,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:17:53,077 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:17:53,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-24 22:17:53,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-24 22:17:53,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:17:53,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 22:17:53,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:17:54,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2023-12-24 22:17:54,710 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:17:54,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 22:17:54,713 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 22:17:54,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:17:54,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 27 [2023-12-24 22:17:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 22:17:54,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:17:55,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-12-24 22:17:55,656 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2023-12-24 22:17:55,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 80 [2023-12-24 22:17:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 22:17:57,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:17:57,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531430313] [2023-12-24 22:17:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531430313] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:17:57,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:17:57,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-12-24 22:17:57,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099847086] [2023-12-24 22:17:57,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:17:57,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-24 22:17:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:17:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-24 22:17:57,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2023-12-24 22:17:57,837 INFO L87 Difference]: Start difference. First operand 200 states and 250 transitions. Second operand has 32 states, 32 states have (on average 1.75) internal successors, (56), 32 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:18:13,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:18:17,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:18:21,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:18:25,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:18:29,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:18:31,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:18:31,474 INFO L93 Difference]: Finished difference Result 300 states and 357 transitions. [2023-12-24 22:18:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-24 22:18:31,474 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.75) internal successors, (56), 32 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-24 22:18:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:18:31,475 INFO L225 Difference]: With dead ends: 300 [2023-12-24 22:18:31,476 INFO L226 Difference]: Without dead ends: 298 [2023-12-24 22:18:31,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1246, Invalid=5234, Unknown=0, NotChecked=0, Total=6480 [2023-12-24 22:18:31,477 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 426 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 83 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2023-12-24 22:18:31,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 416 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 974 Invalid, 5 Unknown, 0 Unchecked, 24.7s Time] [2023-12-24 22:18:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-24 22:18:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 209. [2023-12-24 22:18:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.2596153846153846) internal successors, (262), 208 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:18:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 262 transitions. [2023-12-24 22:18:31,529 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 262 transitions. Word has length 34 [2023-12-24 22:18:31,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:18:31,529 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 262 transitions. [2023-12-24 22:18:31,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.75) internal successors, (56), 32 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:18:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 262 transitions. [2023-12-24 22:18:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 22:18:31,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:18:31,530 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:18:31,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-12-24 22:18:31,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:18:31,733 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:18:31,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:18:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1953082479, now seen corresponding path program 4 times [2023-12-24 22:18:31,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:18:31,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135437288] [2023-12-24 22:18:31,733 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 22:18:31,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:18:31,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:18:31,734 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:18:31,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-24 22:18:31,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 22:18:31,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:18:31,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 22:18:31,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:18:32,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-12-24 22:18:32,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:18:32,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 18 [2023-12-24 22:18:32,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:18:32,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2023-12-24 22:18:32,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:18:32,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 20 [2023-12-24 22:18:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-24 22:18:32,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:18:33,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2023-12-24 22:18:33,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:18:33,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4988 treesize of output 4362 [2023-12-24 22:18:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-24 22:18:36,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:18:36,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135437288] [2023-12-24 22:18:36,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135437288] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:18:36,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:18:36,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2023-12-24 22:18:36,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88257126] [2023-12-24 22:18:36,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:18:36,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-24 22:18:36,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:18:36,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-24 22:18:36,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2023-12-24 22:18:36,342 INFO L87 Difference]: Start difference. First operand 209 states and 262 transitions. Second operand has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:18:41,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:18:45,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:18:48,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:18:52,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:18:57,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:19:02,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:19:13,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:19:19,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:19:23,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:19:29,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:19:33,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:19:39,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:19:54,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:19:59,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:20:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:20:04,610 INFO L93 Difference]: Finished difference Result 403 states and 480 transitions. [2023-12-24 22:20:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-24 22:20:04,610 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-24 22:20:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:20:04,611 INFO L225 Difference]: With dead ends: 403 [2023-12-24 22:20:04,611 INFO L226 Difference]: Without dead ends: 401 [2023-12-24 22:20:04,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=464, Invalid=2841, Unknown=1, NotChecked=0, Total=3306 [2023-12-24 22:20:04,614 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 179 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 20 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:20:04,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 279 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 665 Invalid, 13 Unknown, 0 Unchecked, 62.2s Time] [2023-12-24 22:20:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-12-24 22:20:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 235. [2023-12-24 22:20:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.2692307692307692) internal successors, (297), 234 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:20:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 297 transitions. [2023-12-24 22:20:04,681 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 297 transitions. Word has length 34 [2023-12-24 22:20:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:20:04,681 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 297 transitions. [2023-12-24 22:20:04,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:20:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 297 transitions. [2023-12-24 22:20:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 22:20:04,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:20:04,682 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:20:04,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-24 22:20:04,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:20:04,886 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:20:04,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:20:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1291857316, now seen corresponding path program 4 times [2023-12-24 22:20:04,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:20:04,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131896926] [2023-12-24 22:20:04,887 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 22:20:04,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:20:04,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:20:04,888 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:20:04,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-24 22:20:04,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 22:20:04,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:20:04,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 22:20:04,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:20:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 22:20:05,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:20:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-24 22:20:06,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:20:06,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131896926] [2023-12-24 22:20:06,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131896926] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:20:06,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:20:06,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2023-12-24 22:20:06,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329033234] [2023-12-24 22:20:06,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:20:06,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-24 22:20:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:20:06,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-24 22:20:06,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2023-12-24 22:20:06,473 INFO L87 Difference]: Start difference. First operand 235 states and 297 transitions. Second operand has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:20:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:20:07,886 INFO L93 Difference]: Finished difference Result 411 states and 523 transitions. [2023-12-24 22:20:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 22:20:07,887 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-24 22:20:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:20:07,888 INFO L225 Difference]: With dead ends: 411 [2023-12-24 22:20:07,888 INFO L226 Difference]: Without dead ends: 362 [2023-12-24 22:20:07,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2023-12-24 22:20:07,891 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 305 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 22:20:07,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 409 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 22:20:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2023-12-24 22:20:07,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 303. [2023-12-24 22:20:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.2317880794701987) internal successors, (372), 302 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:20:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 372 transitions. [2023-12-24 22:20:07,977 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 372 transitions. Word has length 35 [2023-12-24 22:20:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:20:07,977 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 372 transitions. [2023-12-24 22:20:07,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:20:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 372 transitions. [2023-12-24 22:20:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-24 22:20:07,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:20:07,978 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:20:07,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-24 22:20:08,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:20:08,181 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:20:08,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:20:08,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1249698403, now seen corresponding path program 5 times [2023-12-24 22:20:08,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:20:08,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388942721] [2023-12-24 22:20:08,182 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-24 22:20:08,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:20:08,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:20:08,183 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:20:08,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-24 22:20:08,341 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-12-24 22:20:08,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:20:08,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 22:20:08,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:20:08,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 22:20:09,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-24 22:20:09,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:20:09,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2023-12-24 22:20:09,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:20:09,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2023-12-24 22:20:10,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:20:10,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2023-12-24 22:20:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:20:10,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:20:23,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2023-12-24 22:20:23,511 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2023-12-24 22:20:23,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4847451 treesize of output 4716388 [2023-12-24 22:20:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:20:25,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:20:25,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388942721] [2023-12-24 22:20:25,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388942721] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:20:25,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:20:25,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 42 [2023-12-24 22:20:25,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299802681] [2023-12-24 22:20:25,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:20:25,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-24 22:20:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:20:25,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-24 22:20:25,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1521, Unknown=0, NotChecked=0, Total=1722 [2023-12-24 22:20:25,291 INFO L87 Difference]: Start difference. First operand 303 states and 372 transitions. Second operand has 42 states, 42 states have (on average 1.619047619047619) internal successors, (68), 42 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:20:33,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:20:44,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:20:47,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:20:55,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:20:59,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:03,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:07,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:11,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:21:17,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:25,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:29,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:33,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:36,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:41,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:44,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:54,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:21:58,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-24 22:22:01,655 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 22:22:01,665 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 22:22:02,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 22:22:02,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-24 22:22:02,865 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 22:22:02,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-24 22:22:02,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=525, Invalid=3764, Unknown=1, NotChecked=0, Total=4290 [2023-12-24 22:22:02,893 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 126 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 58 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.9s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:02,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 103 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 891 Invalid, 13 Unknown, 0 Unchecked, 78.9s Time] [2023-12-24 22:22:02,894 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:22:02,894 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-24 22:22:02,897 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:22:02,898 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:22:02,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:22:02 BoogieIcfgContainer [2023-12-24 22:22:02,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:22:02,906 INFO L158 Benchmark]: Toolchain (without parser) took 883827.04ms. Allocated memory is still 262.1MB. Free memory was 216.8MB in the beginning and 188.1MB in the end (delta: 28.7MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. [2023-12-24 22:22:02,907 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 189.8MB. Free memory was 144.1MB in the beginning and 144.0MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:22:02,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.92ms. Allocated memory is still 262.1MB. Free memory was 216.8MB in the beginning and 205.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 22:22:02,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.53ms. Allocated memory is still 262.1MB. Free memory was 205.3MB in the beginning and 203.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:22:02,907 INFO L158 Benchmark]: Boogie Preprocessor took 40.38ms. Allocated memory is still 262.1MB. Free memory was 203.7MB in the beginning and 201.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:22:02,907 INFO L158 Benchmark]: RCFGBuilder took 364.63ms. Allocated memory is still 262.1MB. Free memory was 201.6MB in the beginning and 187.5MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 22:22:02,907 INFO L158 Benchmark]: TraceAbstraction took 883216.11ms. Allocated memory is still 262.1MB. Free memory was 186.9MB in the beginning and 188.1MB in the end (delta: -1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:22:02,907 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 189.8MB. Free memory was 144.1MB in the beginning and 144.0MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.92ms. Allocated memory is still 262.1MB. Free memory was 216.8MB in the beginning and 205.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.53ms. Allocated memory is still 262.1MB. Free memory was 205.3MB in the beginning and 203.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.38ms. Allocated memory is still 262.1MB. Free memory was 203.7MB in the beginning and 201.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 364.63ms. Allocated memory is still 262.1MB. Free memory was 201.6MB in the beginning and 187.5MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 883216.11ms. Allocated memory is still 262.1MB. Free memory was 186.9MB in the beginning and 188.1MB in the end (delta: -1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 7). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.2s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 821.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 141 mSolverCounterUnknown, 4128 SdHoareTripleChecker+Valid, 655.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4128 mSDsluCounter, 3242 SdHoareTripleChecker+Invalid, 652.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2901 mSDsCounter, 584 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7157 IncrementalHoareTripleChecker+Invalid, 7883 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 584 mSolverCounterUnsat, 341 mSDtfsCounter, 7157 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1409 GetRequests, 592 SyntacticMatches, 7 SemanticMatches, 810 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15108 ImplicationChecksByTransitivity, 205.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=18, InterpolantAutomatonStates: 592, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 993 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 55.5s InterpolantComputationTime, 494 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 934 ConstructedInterpolants, 126 QuantifiedInterpolants, 13438 SizeOfPredicates, 157 NumberOfNonLiveVariables, 1521 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 36 InterpolantComputations, 2 PerfectInterpolantSequences, 326/900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown