/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/loop-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:33:11,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:33:11,099 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-16 16:33:11,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:33:11,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:33:11,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:33:11,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:33:11,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:33:11,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:33:11,133 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:33:11,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:33:11,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:33:11,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:33:11,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:33:11,135 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:33:11,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:33:11,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:33:11,136 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:33:11,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:33:11,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:33:11,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:33:11,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:33:11,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:33:11,137 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:33:11,137 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:33:11,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:33:11,137 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:33:11,137 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:33:11,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:33:11,138 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:33:11,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:33:11,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:33:11,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:33:11,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:33:11,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:33:11,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:33:11,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:33:11,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:33:11,139 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:33:11,139 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:33:11,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:33:11,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:33:11,140 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:33:11,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:33:11,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:33:11,140 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:33:11,140 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-16 16:33:11,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:33:11,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:33:11,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:33:11,345 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:33:11,345 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:33:11,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2023-12-16 16:33:12,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:33:12,498 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:33:12,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2023-12-16 16:33:12,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba296266/1a1213ec483d421fa640eae295a0b91f/FLAGe3b2cf538 [2023-12-16 16:33:12,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba296266/1a1213ec483d421fa640eae295a0b91f [2023-12-16 16:33:12,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:33:12,519 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:33:12,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:33:12,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:33:12,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:33:12,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6066c790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12, skipping insertion in model container [2023-12-16 16:33:12,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,543 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:33:12,645 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i[891,904] [2023-12-16 16:33:12,654 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:33:12,664 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:33:12,675 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i[891,904] [2023-12-16 16:33:12,677 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:33:12,686 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:33:12,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12 WrapperNode [2023-12-16 16:33:12,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:33:12,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:33:12,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:33:12,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:33:12,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,708 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2023-12-16 16:33:12,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:33:12,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:33:12,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:33:12,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:33:12,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,731 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 16:33:12,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:33:12,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:33:12,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:33:12,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:33:12,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (1/1) ... [2023-12-16 16:33:12,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:33:12,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:33:12,801 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-16 16:33:12,811 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-16 16:33:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:33:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:33:12,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:33:12,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:33:12,877 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:33:12,880 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:33:13,029 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:33:13,043 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:33:13,044 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 16:33:13,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:33:13 BoogieIcfgContainer [2023-12-16 16:33:13,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:33:13,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:33:13,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:33:13,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:33:13,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:33:12" (1/3) ... [2023-12-16 16:33:13,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f424b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:33:13, skipping insertion in model container [2023-12-16 16:33:13,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:33:12" (2/3) ... [2023-12-16 16:33:13,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f424b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:33:13, skipping insertion in model container [2023-12-16 16:33:13,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:33:13" (3/3) ... [2023-12-16 16:33:13,054 INFO L112 eAbstractionObserver]: Analyzing ICFG half.i [2023-12-16 16:33:13,066 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:33:13,066 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:33:13,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:33:13,113 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;@5aac912b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:33:13,113 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:33:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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-16 16:33:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:33:13,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:33:13,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:33:13,124 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:33:13,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:33:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2068504419, now seen corresponding path program 1 times [2023-12-16 16:33:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:33:13,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561137695] [2023-12-16 16:33:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:33:13,138 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-16 16:33:13,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:33:13,139 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-16 16:33:13,140 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-16 16:33:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:33:13,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:33:13,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:33:13,192 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-16 16:33:13,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:33:13,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:33:13,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561137695] [2023-12-16 16:33:13,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561137695] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:33:13,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:33:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:33:13,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588642140] [2023-12-16 16:33:13,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:33:13,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:33:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:33:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:33:13,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:33:13,215 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 16:33:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:33:13,228 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2023-12-16 16:33:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:33:13,230 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-12-16 16:33:13,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:33:13,234 INFO L225 Difference]: With dead ends: 19 [2023-12-16 16:33:13,235 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 16:33:13,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-16 16:33:13,240 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:33:13,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:33:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 16:33:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-12-16 16:33:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-16 16:33:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-12-16 16:33:13,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2023-12-16 16:33:13,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:33:13,261 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-12-16 16:33:13,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 16:33:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-12-16 16:33:13,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:33:13,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:33:13,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:33:13,265 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 (2)] Ended with exit code 0 [2023-12-16 16:33:13,464 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-16 16:33:13,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:33:13,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:33:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2068176718, now seen corresponding path program 1 times [2023-12-16 16:33:13,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:33:13,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625191953] [2023-12-16 16:33:13,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:33:13,466 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-16 16:33:13,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:33:13,467 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-16 16:33:13,469 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-16 16:33:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:33:13,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:33:13,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:33:13,656 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-16 16:33:13,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:33:13,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:33:13,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625191953] [2023-12-16 16:33:13,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625191953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:33:13,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:33:13,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:33:13,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065505241] [2023-12-16 16:33:13,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:33:13,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:33:13,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:33:13,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:33:13,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:33:13,659 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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-16 16:33:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:33:13,739 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2023-12-16 16:33:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:33:13,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2023-12-16 16:33:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:33:13,740 INFO L225 Difference]: With dead ends: 20 [2023-12-16 16:33:13,740 INFO L226 Difference]: Without dead ends: 11 [2023-12-16 16:33:13,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:33:13,741 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:33:13,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:33:13,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-16 16:33:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-16 16:33:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-16 16:33:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-12-16 16:33:13,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2023-12-16 16:33:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:33:13,744 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-12-16 16:33:13,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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-16 16:33:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-12-16 16:33:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:33:13,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:33:13,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:33:13,750 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-16 16:33:13,950 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-16 16:33:13,951 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:33:13,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:33:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1009223293, now seen corresponding path program 1 times [2023-12-16 16:33:13,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:33:13,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407697096] [2023-12-16 16:33:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:33:13,952 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-16 16:33:13,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:33:13,953 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-16 16:33:13,959 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-16 16:33:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:33:13,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:33:13,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:33:14,078 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-16 16:33:14,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:33:14,155 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-16 16:33:14,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:33:14,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407697096] [2023-12-16 16:33:14,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407697096] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:33:14,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:33:14,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 16:33:14,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763339275] [2023-12-16 16:33:14,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:33:14,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:33:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:33:14,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:33:14,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:33:14,157 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-16 16:33:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:33:14,227 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-12-16 16:33:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:33:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-16 16:33:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:33:14,227 INFO L225 Difference]: With dead ends: 26 [2023-12-16 16:33:14,227 INFO L226 Difference]: Without dead ends: 19 [2023-12-16 16:33:14,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:33:14,229 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:33:14,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 8 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:33:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-16 16:33:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-16 16:33:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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-16 16:33:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-16 16:33:14,233 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2023-12-16 16:33:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:33:14,233 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-16 16:33:14,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-16 16:33:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-16 16:33:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-16 16:33:14,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:33:14,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:33:14,237 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 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:33:14,434 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-16 16:33:14,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:33:14,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:33:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash 596207724, now seen corresponding path program 1 times [2023-12-16 16:33:14,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:33:14,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659305894] [2023-12-16 16:33:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:33:14,435 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-16 16:33:14,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:33:14,437 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-16 16:33:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:33:14,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 16:33:14,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:33:14,464 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-16 16:33:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:33:14,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:33:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:33:15,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:33:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659305894] [2023-12-16 16:33:15,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659305894] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:33:15,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:33:15,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-16 16:33:15,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538904530] [2023-12-16 16:33:15,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:33:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 16:33:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:33:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 16:33:15,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:33:15,077 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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-16 16:33:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:33:15,511 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-12-16 16:33:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 16:33:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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) Word has length 12 [2023-12-16 16:33:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:33:15,512 INFO L225 Difference]: With dead ends: 37 [2023-12-16 16:33:15,513 INFO L226 Difference]: Without dead ends: 24 [2023-12-16 16:33:15,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2023-12-16 16:33:15,514 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:33:15,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 14 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:33:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-16 16:33:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-12-16 16:33:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-16 16:33:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-12-16 16:33:15,519 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 12 [2023-12-16 16:33:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:33:15,519 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-12-16 16:33:15,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 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-16 16:33:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-12-16 16:33:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 16:33:15,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:33:15,520 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-16 16:33:15,537 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 (5)] Ended with exit code 0 [2023-12-16 16:33:15,720 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-16 16:33:15,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:33:15,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:33:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1960009853, now seen corresponding path program 2 times [2023-12-16 16:33:15,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:33:15,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344305014] [2023-12-16 16:33:15,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:33:15,722 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-16 16:33:15,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:33:15,726 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-16 16:33:15,729 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-16 16:33:15,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:33:15,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:33:15,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:33:15,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:33:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:33:15,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:33:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:33:15,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:33:15,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344305014] [2023-12-16 16:33:15,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344305014] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:33:15,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:33:15,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2023-12-16 16:33:15,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270155323] [2023-12-16 16:33:15,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:33:15,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 16:33:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:33:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 16:33:15,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:33:15,854 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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-16 16:33:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:33:15,894 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2023-12-16 16:33:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:33:15,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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) Word has length 21 [2023-12-16 16:33:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:33:15,895 INFO L225 Difference]: With dead ends: 38 [2023-12-16 16:33:15,895 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 16:33:15,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:33:15,897 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:33:15,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 13 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:33:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 16:33:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-12-16 16:33:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-16 16:33:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2023-12-16 16:33:15,901 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2023-12-16 16:33:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:33:15,901 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2023-12-16 16:33:15,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 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-16 16:33:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2023-12-16 16:33:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 16:33:15,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:33:15,902 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1] [2023-12-16 16:33:15,910 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 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:33:16,104 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-16 16:33:16,105 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:33:16,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:33:16,105 INFO L85 PathProgramCache]: Analyzing trace with hash 601222952, now seen corresponding path program 3 times [2023-12-16 16:33:16,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:33:16,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674753718] [2023-12-16 16:33:16,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:33:16,106 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-16 16:33:16,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:33:16,107 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-16 16:33:16,133 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-16 16:33:16,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-12-16 16:33:16,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:33:16,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 16:33:16,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:33:16,542 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-16 16:33:16,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:33:18,098 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-16 16:33:18,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:33:18,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674753718] [2023-12-16 16:33:18,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674753718] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:33:18,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:33:18,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-12-16 16:33:18,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138550771] [2023-12-16 16:33:18,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:33:18,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-16 16:33:18,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:33:18,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-16 16:33:18,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 16:33:18,101 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 33 states, 33 states have (on average 1.393939393939394) internal successors, (46), 32 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-16 16:33:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:33:26,000 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2023-12-16 16:33:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-16 16:33:26,001 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.393939393939394) internal successors, (46), 32 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 24 [2023-12-16 16:33:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:33:26,002 INFO L225 Difference]: With dead ends: 55 [2023-12-16 16:33:26,002 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 16:33:26,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=846, Invalid=2814, Unknown=0, NotChecked=0, Total=3660 [2023-12-16 16:33:26,004 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 68 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 16:33:26,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 18 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 16:33:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 16:33:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-16 16:33:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-16 16:33:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2023-12-16 16:33:26,030 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 24 [2023-12-16 16:33:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:33:26,031 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2023-12-16 16:33:26,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.393939393939394) internal successors, (46), 32 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-16 16:33:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2023-12-16 16:33:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-16 16:33:26,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:33:26,032 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 7, 7, 1, 1, 1, 1, 1, 1] [2023-12-16 16:33:26,037 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-16 16:33:26,232 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-16 16:33:26,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:33:26,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:33:26,233 INFO L85 PathProgramCache]: Analyzing trace with hash 131419808, now seen corresponding path program 4 times [2023-12-16 16:33:26,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:33:26,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024701292] [2023-12-16 16:33:26,234 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:33:26,234 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-16 16:33:26,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:33:26,236 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-16 16:33:26,237 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-16 16:33:26,283 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:33:26,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:33:26,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-16 16:33:26,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:33:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:33:27,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:33:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:33:32,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:33:32,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024701292] [2023-12-16 16:33:32,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024701292] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:33:32,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:33:32,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 58 [2023-12-16 16:33:32,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037353071] [2023-12-16 16:33:32,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:33:32,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-12-16 16:33:32,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:33:32,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-12-16 16:33:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=2925, Unknown=0, NotChecked=0, Total=3422 [2023-12-16 16:33:32,628 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 59 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 58 states have internal predecessors, (94), 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-16 16:34:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:34:25,662 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2023-12-16 16:34:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-12-16 16:34:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 58 states have internal predecessors, (94), 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 48 [2023-12-16 16:34:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:34:25,674 INFO L225 Difference]: With dead ends: 116 [2023-12-16 16:34:25,674 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 16:34:25,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3585 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=2610, Invalid=13392, Unknown=0, NotChecked=0, Total=16002 [2023-12-16 16:34:25,678 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 156 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:34:25,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 64 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-16 16:34:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 16:34:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2023-12-16 16:34:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.0104166666666667) internal successors, (97), 96 states have internal predecessors, (97), 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-16 16:34:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2023-12-16 16:34:25,700 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 48 [2023-12-16 16:34:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:34:25,701 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2023-12-16 16:34:25,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 58 states have internal predecessors, (94), 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-16 16:34:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2023-12-16 16:34:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 16:34:25,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:34:25,705 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 15, 15, 1, 1, 1, 1, 1, 1] [2023-12-16 16:34:25,708 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-16 16:34:25,908 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-16 16:34:25,908 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:34:25,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:34:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1531882096, now seen corresponding path program 5 times [2023-12-16 16:34:25,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:34:25,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844369655] [2023-12-16 16:34:25,911 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 16:34:25,911 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-16 16:34:25,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:34:25,913 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-16 16:34:25,913 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-16 16:34:26,061 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2023-12-16 16:34:26,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:34:26,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-16 16:34:26,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:34:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:34:29,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-16 16:34:29,821 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-16 16:34:29,821 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:34:29,826 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-16 16:34:29,852 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 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:34:30,022 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-16 16:34:30,022 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 97 with TraceHistMax 30,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. [2023-12-16 16:34:30,026 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-12-16 16:34:30,027 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:34:30,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:34:30 BoogieIcfgContainer [2023-12-16 16:34:30,030 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:34:30,030 INFO L158 Benchmark]: Toolchain (without parser) took 77510.76ms. Allocated memory is still 306.2MB. Free memory was 259.0MB in the beginning and 180.7MB in the end (delta: 78.3MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. [2023-12-16 16:34:30,030 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:34:30,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.77ms. Allocated memory is still 306.2MB. Free memory was 259.0MB in the beginning and 247.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:34:30,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.82ms. Allocated memory is still 306.2MB. Free memory was 247.5MB in the beginning and 246.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 16:34:30,030 INFO L158 Benchmark]: Boogie Preprocessor took 31.20ms. Allocated memory is still 306.2MB. Free memory was 246.3MB in the beginning and 244.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:34:30,031 INFO L158 Benchmark]: RCFGBuilder took 303.47ms. Allocated memory is still 306.2MB. Free memory was 244.3MB in the beginning and 233.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 16:34:30,031 INFO L158 Benchmark]: TraceAbstraction took 76983.89ms. Allocated memory is still 306.2MB. Free memory was 232.8MB in the beginning and 180.7MB in the end (delta: 52.1MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2023-12-16 16:34:30,032 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.12ms. Allocated memory is still 182.5MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.77ms. Allocated memory is still 306.2MB. Free memory was 259.0MB in the beginning and 247.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.82ms. Allocated memory is still 306.2MB. Free memory was 247.5MB in the beginning and 246.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.20ms. Allocated memory is still 306.2MB. Free memory was 246.3MB in the beginning and 244.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 303.47ms. Allocated memory is still 306.2MB. Free memory was 244.3MB in the beginning and 233.7MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 76983.89ms. Allocated memory is still 306.2MB. Free memory was 232.8MB in the beginning and 180.7MB in the end (delta: 52.1MB). Peak memory consumption was 53.5MB. 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: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 97 with TraceHistMax 30,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 62 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.9s, OverallIterations: 8, TraceHistogramMax: 30, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 61.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1903 IncrementalHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 29 mSDtfsCounter, 1903 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4494 ImplicationChecksByTransitivity, 61.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=7, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 3359 SizeOfPredicates, 22 NumberOfNonLiveVariables, 239 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 45/758 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