/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/recursive/Fibonacci02.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:05:24,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:05:24,683 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-25 06:05:24,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:05:24,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:05:24,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:05:24,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:05:24,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:05:24,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:05:24,715 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:05:24,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:05:24,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:05:24,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:05:24,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:05:24,717 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:05:24,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:05:24,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:05:24,718 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:05:24,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:05:24,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:05:24,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:05:24,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:05:24,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:05:24,719 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:05:24,719 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:05:24,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:05:24,720 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:05:24,720 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:05:24,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:05:24,720 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:05:24,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:05:24,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:05:24,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:05:24,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:05:24,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:05:24,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:05:24,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:05:24,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:05:24,722 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:05:24,722 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:05:24,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:05:24,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:05:24,722 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:05:24,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:05:24,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:05:24,723 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:05:24,723 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-25 06:05:24,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:05:24,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:05:24,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:05:24,976 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:05:24,976 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:05:24,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci02.c [2023-12-25 06:05:26,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:05:26,351 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:05:26,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci02.c [2023-12-25 06:05:26,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff716ec9/097f091ec0af4d079f7da12b982a6b4b/FLAG3cffa49e4 [2023-12-25 06:05:26,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff716ec9/097f091ec0af4d079f7da12b982a6b4b [2023-12-25 06:05:26,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:05:26,375 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:05:26,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:05:26,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:05:26,382 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:05:26,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c9c5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26, skipping insertion in model container [2023-12-25 06:05:26,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,402 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:05:26,546 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci02.c[715,728] [2023-12-25 06:05:26,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:05:26,566 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:05:26,578 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci02.c[715,728] [2023-12-25 06:05:26,579 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:05:26,592 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:05:26,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26 WrapperNode [2023-12-25 06:05:26,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:05:26,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:05:26,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:05:26,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:05:26,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,620 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2023-12-25 06:05:26,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:05:26,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:05:26,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:05:26,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:05:26,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,643 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-25 06:05:26,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:05:26,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:05:26,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:05:26,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:05:26,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (1/1) ... [2023-12-25 06:05:26,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:05:26,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:05:26,686 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-25 06:05:26,703 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-25 06:05:26,711 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-12-25 06:05:26,712 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-12-25 06:05:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:05:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:05:26,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:05:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:05:26,775 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:05:26,777 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:05:26,894 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:05:26,914 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:05:26,914 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:05:26,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:05:26 BoogieIcfgContainer [2023-12-25 06:05:26,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:05:26,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:05:26,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:05:26,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:05:26,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:05:26" (1/3) ... [2023-12-25 06:05:26,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27110ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:05:26, skipping insertion in model container [2023-12-25 06:05:26,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:05:26" (2/3) ... [2023-12-25 06:05:26,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27110ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:05:26, skipping insertion in model container [2023-12-25 06:05:26,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:05:26" (3/3) ... [2023-12-25 06:05:26,921 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2023-12-25 06:05:26,934 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:05:26,934 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:05:26,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:05:26,988 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;@38a18400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:05:26,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:05:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-25 06:05:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 06:05:26,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:27,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:27,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:27,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1551711717, now seen corresponding path program 1 times [2023-12-25 06:05:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582638274] [2023-12-25 06:05:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:27,020 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-25 06:05:27,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:27,036 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-25 06:05:27,044 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-25 06:05:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:27,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:05:27,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:27,190 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-25 06:05:27,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:05:27,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:27,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582638274] [2023-12-25 06:05:27,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582638274] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:05:27,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:05:27,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:05:27,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901454424] [2023-12-25 06:05:27,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:05:27,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:05:27,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:27,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:05:27,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:05:27,242 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:05:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:27,324 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2023-12-25 06:05:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:05:27,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-25 06:05:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:27,334 INFO L225 Difference]: With dead ends: 24 [2023-12-25 06:05:27,335 INFO L226 Difference]: Without dead ends: 16 [2023-12-25 06:05:27,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:05:27,344 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:27,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:05:27,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-25 06:05:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-25 06:05:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 06:05:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-12-25 06:05:27,379 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2023-12-25 06:05:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:27,379 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-12-25 06:05:27,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:05:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-12-25 06:05:27,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 06:05:27,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:27,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:27,395 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-25 06:05:27,583 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-25 06:05:27,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:27,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash -133880903, now seen corresponding path program 1 times [2023-12-25 06:05:27,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:27,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550791374] [2023-12-25 06:05:27,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:27,585 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-25 06:05:27,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:27,587 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-25 06:05:27,588 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-25 06:05:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:27,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:05:27,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:27,640 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-25 06:05:27,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:05:27,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:27,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550791374] [2023-12-25 06:05:27,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550791374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:05:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:05:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:05:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116632324] [2023-12-25 06:05:27,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:05:27,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:05:27,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:27,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:05:27,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:05:27,643 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:05:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:27,713 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2023-12-25 06:05:27,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:05:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-25 06:05:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:27,715 INFO L225 Difference]: With dead ends: 22 [2023-12-25 06:05:27,715 INFO L226 Difference]: Without dead ends: 18 [2023-12-25 06:05:27,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:05:27,716 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:27,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-25 06:05:27,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-12-25 06:05:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-25 06:05:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-12-25 06:05:27,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2023-12-25 06:05:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:27,723 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-12-25 06:05:27,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:05:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-12-25 06:05:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:05:27,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:27,724 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:27,731 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-25 06:05:27,927 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-25 06:05:27,928 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:27,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1313483099, now seen corresponding path program 1 times [2023-12-25 06:05:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:27,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78299787] [2023-12-25 06:05:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:27,929 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-25 06:05:27,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:27,932 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-25 06:05:27,933 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-25 06:05:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:27,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:05:27,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:05:28,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 06:05:28,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:28,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78299787] [2023-12-25 06:05:28,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78299787] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:28,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:28,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2023-12-25 06:05:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752243885] [2023-12-25 06:05:28,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:28,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 06:05:28,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:28,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 06:05:28,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 06:05:28,282 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:05:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:28,392 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2023-12-25 06:05:28,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:05:28,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 21 [2023-12-25 06:05:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:28,394 INFO L225 Difference]: With dead ends: 26 [2023-12-25 06:05:28,394 INFO L226 Difference]: Without dead ends: 22 [2023-12-25 06:05:28,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:05:28,398 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:28,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 36 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-25 06:05:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-12-25 06:05:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 06:05:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2023-12-25 06:05:28,405 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 21 [2023-12-25 06:05:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:28,405 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2023-12-25 06:05:28,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:05:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2023-12-25 06:05:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 06:05:28,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:28,406 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:28,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 06:05:28,608 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-25 06:05:28,611 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:28,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash -915476149, now seen corresponding path program 1 times [2023-12-25 06:05:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:28,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133649150] [2023-12-25 06:05:28,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:05:28,613 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-25 06:05:28,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:28,614 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-25 06:05:28,619 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-25 06:05:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:28,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:05:28,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 06:05:28,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 06:05:28,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:28,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133649150] [2023-12-25 06:05:28,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133649150] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:28,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:28,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2023-12-25 06:05:28,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911757552] [2023-12-25 06:05:28,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:28,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 06:05:28,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:28,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 06:05:28,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 06:05:28,880 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 9 states, 7 states have (on average 3.0) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:05:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:28,970 INFO L93 Difference]: Finished difference Result 44 states and 78 transitions. [2023-12-25 06:05:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:05:28,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 22 [2023-12-25 06:05:28,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:28,972 INFO L225 Difference]: With dead ends: 44 [2023-12-25 06:05:28,972 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 06:05:28,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:05:28,973 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:28,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 36 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:28,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 06:05:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 06:05:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2023-12-25 06:05:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 41 transitions. [2023-12-25 06:05:28,981 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 41 transitions. Word has length 22 [2023-12-25 06:05:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:28,981 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 41 transitions. [2023-12-25 06:05:28,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:05:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2023-12-25 06:05:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 06:05:28,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:28,982 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:28,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:29,188 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-25 06:05:29,188 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:29,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:29,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1580342811, now seen corresponding path program 2 times [2023-12-25 06:05:29,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:29,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406873797] [2023-12-25 06:05:29,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:05:29,189 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-25 06:05:29,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:29,190 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-25 06:05:29,194 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-25 06:05:29,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:05:29,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:29,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:05:29,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 06:05:29,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 06:05:29,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406873797] [2023-12-25 06:05:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406873797] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:29,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:29,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2023-12-25 06:05:29,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464631382] [2023-12-25 06:05:29,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:29,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 06:05:29,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:29,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 06:05:29,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:05:29,633 INFO L87 Difference]: Start difference. First operand 26 states and 41 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 06:05:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:29,813 INFO L93 Difference]: Finished difference Result 59 states and 109 transitions. [2023-12-25 06:05:29,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:05:29,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) Word has length 33 [2023-12-25 06:05:29,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:29,816 INFO L225 Difference]: With dead ends: 59 [2023-12-25 06:05:29,816 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 06:05:29,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:05:29,817 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:29,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 46 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 06:05:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2023-12-25 06:05:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2023-12-25 06:05:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2023-12-25 06:05:29,824 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 33 [2023-12-25 06:05:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:29,824 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2023-12-25 06:05:29,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 06:05:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2023-12-25 06:05:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 06:05:29,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:29,831 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:29,846 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-25 06:05:30,034 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-25 06:05:30,037 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:30,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash -627546379, now seen corresponding path program 2 times [2023-12-25 06:05:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:30,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142265174] [2023-12-25 06:05:30,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:05:30,038 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-25 06:05:30,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:30,039 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-25 06:05:30,041 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-25 06:05:30,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:05:30,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:30,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:05:30,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-25 06:05:30,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 06:05:30,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:30,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142265174] [2023-12-25 06:05:30,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142265174] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:30,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:30,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2023-12-25 06:05:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83446780] [2023-12-25 06:05:30,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:30,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 06:05:30,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:30,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 06:05:30,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:05:30,313 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 06:05:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:30,413 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2023-12-25 06:05:30,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:05:30,413 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2023-12-25 06:05:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:30,414 INFO L225 Difference]: With dead ends: 66 [2023-12-25 06:05:30,414 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 06:05:30,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:05:30,415 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:30,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 57 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 06:05:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-12-25 06:05:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (22), 10 states have call predecessors, (22), 7 states have call successors, (22) [2023-12-25 06:05:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2023-12-25 06:05:30,421 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 35 [2023-12-25 06:05:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:30,422 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2023-12-25 06:05:30,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 06:05:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2023-12-25 06:05:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-25 06:05:30,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:30,424 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:30,439 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-25 06:05:30,636 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-25 06:05:30,637 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:30,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:30,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1401603975, now seen corresponding path program 3 times [2023-12-25 06:05:30,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:30,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156063062] [2023-12-25 06:05:30,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:05:30,638 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-25 06:05:30,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:30,638 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-25 06:05:30,639 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-25 06:05:30,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 06:05:30,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:30,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 06:05:30,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 180 proven. 5 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2023-12-25 06:05:30,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 136 proven. 15 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2023-12-25 06:05:31,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:31,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156063062] [2023-12-25 06:05:31,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156063062] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:31,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:31,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2023-12-25 06:05:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524960543] [2023-12-25 06:05:31,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:31,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:05:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:31,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:05:31,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:05:31,077 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2023-12-25 06:05:31,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:31,182 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions. [2023-12-25 06:05:31,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:05:31,183 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 82 [2023-12-25 06:05:31,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:31,183 INFO L225 Difference]: With dead ends: 65 [2023-12-25 06:05:31,183 INFO L226 Difference]: Without dead ends: 31 [2023-12-25 06:05:31,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:05:31,184 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:31,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-25 06:05:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-25 06:05:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-25 06:05:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-25 06:05:31,189 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 82 [2023-12-25 06:05:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:31,189 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-25 06:05:31,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2023-12-25 06:05:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-25 06:05:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-25 06:05:31,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:31,190 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:31,195 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 (8)] Ended with exit code 0 [2023-12-25 06:05:31,392 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-25 06:05:31,393 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:31,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1725398279, now seen corresponding path program 4 times [2023-12-25 06:05:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:31,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088874494] [2023-12-25 06:05:31,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:05:31,394 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-25 06:05:31,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:31,395 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-25 06:05:31,399 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-25 06:05:31,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:05:31,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:31,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:05:31,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 27 proven. 154 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-25 06:05:31,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 27 proven. 169 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2023-12-25 06:05:31,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088874494] [2023-12-25 06:05:31,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088874494] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:31,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:31,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2023-12-25 06:05:31,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861962892] [2023-12-25 06:05:31,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:31,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 06:05:31,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:31,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 06:05:31,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-25 06:05:31,759 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2023-12-25 06:05:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:31,891 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2023-12-25 06:05:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:05:31,892 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 86 [2023-12-25 06:05:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:31,896 INFO L225 Difference]: With dead ends: 71 [2023-12-25 06:05:31,896 INFO L226 Difference]: Without dead ends: 42 [2023-12-25 06:05:31,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-12-25 06:05:31,898 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:31,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 74 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-25 06:05:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2023-12-25 06:05:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2023-12-25 06:05:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2023-12-25 06:05:31,910 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 86 [2023-12-25 06:05:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:31,910 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2023-12-25 06:05:31,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2023-12-25 06:05:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2023-12-25 06:05:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-25 06:05:31,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:31,911 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:31,925 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:32,125 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-25 06:05:32,125 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:32,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:32,126 INFO L85 PathProgramCache]: Analyzing trace with hash -629170877, now seen corresponding path program 5 times [2023-12-25 06:05:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:32,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360718942] [2023-12-25 06:05:32,126 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:05:32,126 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-25 06:05:32,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:32,128 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:05:32,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 06:05:32,248 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2023-12-25 06:05:32,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:32,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 06:05:32,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 310 proven. 265 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2023-12-25 06:05:32,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 321 proven. 309 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2023-12-25 06:05:34,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:34,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360718942] [2023-12-25 06:05:34,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360718942] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:34,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:34,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 23 [2023-12-25 06:05:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526561518] [2023-12-25 06:05:34,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:34,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 06:05:34,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 06:05:34,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-12-25 06:05:34,271 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 21 states have internal predecessors, (54), 15 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (27), 13 states have call predecessors, (27), 15 states have call successors, (27) [2023-12-25 06:05:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:34,707 INFO L93 Difference]: Finished difference Result 98 states and 163 transitions. [2023-12-25 06:05:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 06:05:34,708 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 21 states have internal predecessors, (54), 15 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (27), 13 states have call predecessors, (27), 15 states have call successors, (27) Word has length 136 [2023-12-25 06:05:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:34,709 INFO L225 Difference]: With dead ends: 98 [2023-12-25 06:05:34,709 INFO L226 Difference]: Without dead ends: 61 [2023-12-25 06:05:34,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 242 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2023-12-25 06:05:34,710 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 92 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:34,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 133 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:05:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-25 06:05:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2023-12-25 06:05:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (29), 13 states have call predecessors, (29), 10 states have call successors, (29) [2023-12-25 06:05:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2023-12-25 06:05:34,718 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 136 [2023-12-25 06:05:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:34,718 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2023-12-25 06:05:34,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 21 states have internal predecessors, (54), 15 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (27), 13 states have call predecessors, (27), 15 states have call successors, (27) [2023-12-25 06:05:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2023-12-25 06:05:34,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 06:05:34,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:34,719 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:34,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:34,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:05:34,922 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:34,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:34,923 INFO L85 PathProgramCache]: Analyzing trace with hash 629728387, now seen corresponding path program 6 times [2023-12-25 06:05:34,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:34,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504641090] [2023-12-25 06:05:34,923 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:05:34,923 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-25 06:05:34,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:34,924 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:05:34,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 06:05:34,984 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-12-25 06:05:34,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:34,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:05:34,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 41 proven. 212 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-12-25 06:05:35,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 41 proven. 238 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-12-25 06:05:35,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:35,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504641090] [2023-12-25 06:05:35,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504641090] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:35,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:35,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2023-12-25 06:05:35,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898836534] [2023-12-25 06:05:35,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:35,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 06:05:35,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:35,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 06:05:35,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:05:35,436 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 15 states, 13 states have (on average 3.076923076923077) internal successors, (40), 15 states have internal predecessors, (40), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2023-12-25 06:05:35,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:35,618 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2023-12-25 06:05:35,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:05:35,619 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.076923076923077) internal successors, (40), 15 states have internal predecessors, (40), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) Word has length 98 [2023-12-25 06:05:35,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:35,620 INFO L225 Difference]: With dead ends: 55 [2023-12-25 06:05:35,620 INFO L226 Difference]: Without dead ends: 51 [2023-12-25 06:05:35,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-25 06:05:35,621 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:35,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 93 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:05:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-25 06:05:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-25 06:05:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (28), 13 states have call predecessors, (28), 10 states have call successors, (28) [2023-12-25 06:05:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2023-12-25 06:05:35,627 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 98 [2023-12-25 06:05:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:35,627 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2023-12-25 06:05:35,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.076923076923077) internal successors, (40), 15 states have internal predecessors, (40), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2023-12-25 06:05:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2023-12-25 06:05:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-25 06:05:35,628 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:35,628 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:35,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-25 06:05:35,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:05:35,834 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:35,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1273947285, now seen corresponding path program 7 times [2023-12-25 06:05:35,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:35,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656168973] [2023-12-25 06:05:35,835 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:05:35,835 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-25 06:05:35,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:35,836 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:05:35,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 06:05:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:05:35,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-25 06:05:35,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 89 proven. 492 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2023-12-25 06:05:36,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 89 proven. 532 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2023-12-25 06:05:36,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:36,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656168973] [2023-12-25 06:05:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656168973] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:36,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2023-12-25 06:05:36,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97013442] [2023-12-25 06:05:36,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:36,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-25 06:05:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:36,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-25 06:05:36,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-25 06:05:36,592 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 17 states, 15 states have (on average 3.0) internal successors, (45), 17 states have internal predecessors, (45), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2023-12-25 06:05:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:36,835 INFO L93 Difference]: Finished difference Result 119 states and 215 transitions. [2023-12-25 06:05:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-25 06:05:36,836 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 17 states have internal predecessors, (45), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) Word has length 161 [2023-12-25 06:05:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:36,837 INFO L225 Difference]: With dead ends: 119 [2023-12-25 06:05:36,837 INFO L226 Difference]: Without dead ends: 70 [2023-12-25 06:05:36,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-12-25 06:05:36,838 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 66 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:36,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 122 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:05:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-25 06:05:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2023-12-25 06:05:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (33), 15 states have call predecessors, (33), 12 states have call successors, (33) [2023-12-25 06:05:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2023-12-25 06:05:36,844 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 161 [2023-12-25 06:05:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:36,844 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2023-12-25 06:05:36,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.0) internal successors, (45), 17 states have internal predecessors, (45), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2023-12-25 06:05:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2023-12-25 06:05:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2023-12-25 06:05:36,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:36,847 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:36,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:37,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:05:37,057 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:37,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1637177691, now seen corresponding path program 8 times [2023-12-25 06:05:37,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:37,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193726783] [2023-12-25 06:05:37,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:05:37,058 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-25 06:05:37,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:37,059 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:05:37,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 06:05:37,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:05:37,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:37,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 06:05:37,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6820 backedges. 203 proven. 1373 refuted. 0 times theorem prover too weak. 5244 trivial. 0 not checked. [2023-12-25 06:05:37,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6820 backedges. 203 proven. 1430 refuted. 0 times theorem prover too weak. 5187 trivial. 0 not checked. [2023-12-25 06:05:38,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:38,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193726783] [2023-12-25 06:05:38,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193726783] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:38,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:38,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2023-12-25 06:05:38,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115587807] [2023-12-25 06:05:38,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:38,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 06:05:38,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:38,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 06:05:38,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:05:38,347 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 19 states have internal predecessors, (50), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2023-12-25 06:05:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:38,693 INFO L93 Difference]: Finished difference Result 136 states and 256 transitions. [2023-12-25 06:05:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 06:05:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 19 states have internal predecessors, (50), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) Word has length 325 [2023-12-25 06:05:38,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:38,696 INFO L225 Difference]: With dead ends: 136 [2023-12-25 06:05:38,696 INFO L226 Difference]: Without dead ends: 79 [2023-12-25 06:05:38,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2023-12-25 06:05:38,698 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 81 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:38,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 177 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:05:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-25 06:05:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2023-12-25 06:05:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 14 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (34), 16 states have call predecessors, (34), 14 states have call successors, (34) [2023-12-25 06:05:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2023-12-25 06:05:38,721 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 325 [2023-12-25 06:05:38,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:38,722 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2023-12-25 06:05:38,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 19 states have internal predecessors, (50), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2023-12-25 06:05:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2023-12-25 06:05:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2023-12-25 06:05:38,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:38,733 INFO L195 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:38,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:38,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:05:38,941 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:38,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2012290177, now seen corresponding path program 9 times [2023-12-25 06:05:38,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:38,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278043680] [2023-12-25 06:05:38,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:05:38,942 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-25 06:05:38,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:38,957 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:05:39,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 06:05:39,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2023-12-25 06:05:39,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:39,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 06:05:39,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 18283 backedges. 376 proven. 2708 refuted. 0 times theorem prover too weak. 15199 trivial. 0 not checked. [2023-12-25 06:05:39,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18283 backedges. 376 proven. 2785 refuted. 0 times theorem prover too weak. 15122 trivial. 0 not checked. [2023-12-25 06:05:40,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278043680] [2023-12-25 06:05:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278043680] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:40,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2023-12-25 06:05:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800006696] [2023-12-25 06:05:40,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:40,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 06:05:40,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:40,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 06:05:40,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-12-25 06:05:40,951 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 21 states have internal predecessors, (55), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) [2023-12-25 06:05:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:41,385 INFO L93 Difference]: Finished difference Result 152 states and 274 transitions. [2023-12-25 06:05:41,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 06:05:41,385 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 21 states have internal predecessors, (55), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) Word has length 527 [2023-12-25 06:05:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:41,386 INFO L225 Difference]: With dead ends: 152 [2023-12-25 06:05:41,386 INFO L226 Difference]: Without dead ends: 90 [2023-12-25 06:05:41,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 1033 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2023-12-25 06:05:41,387 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 84 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:41,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 198 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:05:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-25 06:05:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2023-12-25 06:05:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 15 states have call successors, (15), 8 states have call predecessors, (15), 10 states have return successors, (31), 17 states have call predecessors, (31), 15 states have call successors, (31) [2023-12-25 06:05:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2023-12-25 06:05:41,394 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 527 [2023-12-25 06:05:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:41,394 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2023-12-25 06:05:41,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 21 states have internal predecessors, (55), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) [2023-12-25 06:05:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2023-12-25 06:05:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2023-12-25 06:05:41,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:41,399 INFO L195 NwaCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:41,412 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 (14)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:41,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:05:41,612 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:41,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1432509179, now seen corresponding path program 10 times [2023-12-25 06:05:41,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:41,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301135660] [2023-12-25 06:05:41,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:05:41,614 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-25 06:05:41,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:41,629 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:05:41,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 06:05:42,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:05:42,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:42,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 06:05:42,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 48699 backedges. 3174 proven. 2217 refuted. 0 times theorem prover too weak. 43308 trivial. 0 not checked. [2023-12-25 06:05:42,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 48699 backedges. 3174 proven. 2294 refuted. 0 times theorem prover too weak. 43231 trivial. 0 not checked. [2023-12-25 06:05:44,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:44,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301135660] [2023-12-25 06:05:44,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301135660] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:44,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:44,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 20 [2023-12-25 06:05:44,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075907812] [2023-12-25 06:05:44,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:44,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 06:05:44,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:44,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 06:05:44,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2023-12-25 06:05:44,212 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 20 states have internal predecessors, (55), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (27), 12 states have call predecessors, (27), 17 states have call successors, (27) [2023-12-25 06:05:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:45,157 INFO L93 Difference]: Finished difference Result 206 states and 375 transitions. [2023-12-25 06:05:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-12-25 06:05:45,158 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 20 states have internal predecessors, (55), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (27), 12 states have call predecessors, (27), 17 states have call successors, (27) Word has length 855 [2023-12-25 06:05:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:45,161 INFO L225 Difference]: With dead ends: 206 [2023-12-25 06:05:45,161 INFO L226 Difference]: Without dead ends: 137 [2023-12-25 06:05:45,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1753 GetRequests, 1690 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1132, Invalid=3028, Unknown=0, NotChecked=0, Total=4160 [2023-12-25 06:05:45,163 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 183 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:45,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 80 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:05:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-25 06:05:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2023-12-25 06:05:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 65 states have internal predecessors, (75), 21 states have call successors, (21), 15 states have call predecessors, (21), 10 states have return successors, (57), 17 states have call predecessors, (57), 21 states have call successors, (57) [2023-12-25 06:05:45,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 153 transitions. [2023-12-25 06:05:45,182 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 153 transitions. Word has length 855 [2023-12-25 06:05:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:45,185 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 153 transitions. [2023-12-25 06:05:45,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 20 states have internal predecessors, (55), 17 states have call successors, (21), 1 states have call predecessors, (21), 9 states have return successors, (27), 12 states have call predecessors, (27), 17 states have call successors, (27) [2023-12-25 06:05:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 153 transitions. [2023-12-25 06:05:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2023-12-25 06:05:45,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:45,189 INFO L195 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:45,203 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:45,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:05:45,404 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:45,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1834477699, now seen corresponding path program 11 times [2023-12-25 06:05:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:45,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884920859] [2023-12-25 06:05:45,405 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:05:45,405 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-25 06:05:45,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:45,406 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:05:45,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 06:05:47,282 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 92 check-sat command(s) [2023-12-25 06:05:47,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:47,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 220 conjunts are in the unsatisfiable core [2023-12-25 06:05:47,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 31665 backedges. 0 proven. 10071 refuted. 0 times theorem prover too weak. 21594 trivial. 0 not checked. [2023-12-25 06:05:48,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 31665 backedges. 0 proven. 10071 refuted. 0 times theorem prover too weak. 21594 trivial. 0 not checked. [2023-12-25 06:05:52,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:52,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884920859] [2023-12-25 06:05:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884920859] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:52,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:52,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 36 [2023-12-25 06:05:52,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878779181] [2023-12-25 06:05:52,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:52,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-25 06:05:52,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:52,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-25 06:05:52,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 06:05:52,332 INFO L87 Difference]: Start difference. First operand 98 states and 153 transitions. Second operand has 36 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) [2023-12-25 06:05:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:52,727 INFO L93 Difference]: Finished difference Result 110 states and 185 transitions. [2023-12-25 06:05:52,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-25 06:05:52,728 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) Word has length 691 [2023-12-25 06:05:52,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:52,730 INFO L225 Difference]: With dead ends: 110 [2023-12-25 06:05:52,730 INFO L226 Difference]: Without dead ends: 106 [2023-12-25 06:05:52,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1380 GetRequests, 1346 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2023-12-25 06:05:52,731 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:52,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 931 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 06:05:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-25 06:05:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2023-12-25 06:05:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 67 states have internal predecessors, (77), 22 states have call successors, (22), 15 states have call predecessors, (22), 11 states have return successors, (68), 19 states have call predecessors, (68), 22 states have call successors, (68) [2023-12-25 06:05:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 167 transitions. [2023-12-25 06:05:52,746 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 167 transitions. Word has length 691 [2023-12-25 06:05:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:52,746 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 167 transitions. [2023-12-25 06:05:52,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (24), 24 states have call predecessors, (24), 8 states have call successors, (24) [2023-12-25 06:05:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 167 transitions. [2023-12-25 06:05:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2023-12-25 06:05:52,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:05:52,780 INFO L195 NwaCegarLoop]: trace histogram [151, 151, 122, 75, 75, 75, 75, 75, 75, 47, 29, 1, 1, 1, 1, 1, 1] [2023-12-25 06:05:52,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:52,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:05:52,993 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:05:52,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:05:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2030960305, now seen corresponding path program 12 times [2023-12-25 06:05:52,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:05:52,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686953333] [2023-12-25 06:05:52,994 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:05:52,994 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-25 06:05:52,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:05:52,996 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:05:53,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 06:05:53,282 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2023-12-25 06:05:53,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:05:53,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 06:05:53,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:05:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 61006 backedges. 1593 proven. 4994 refuted. 0 times theorem prover too weak. 54419 trivial. 0 not checked. [2023-12-25 06:05:53,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:05:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 61006 backedges. 1593 proven. 5094 refuted. 0 times theorem prover too weak. 54319 trivial. 0 not checked. [2023-12-25 06:05:55,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:05:55,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686953333] [2023-12-25 06:05:55,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686953333] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:05:55,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:05:55,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 23 [2023-12-25 06:05:55,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697230844] [2023-12-25 06:05:55,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:05:55,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 06:05:55,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:05:55,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 06:05:55,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2023-12-25 06:05:55,648 INFO L87 Difference]: Start difference. First operand 102 states and 167 transitions. Second operand has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 23 states have internal predecessors, (60), 19 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (29), 12 states have call predecessors, (29), 19 states have call successors, (29) [2023-12-25 06:05:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:05:56,137 INFO L93 Difference]: Finished difference Result 249 states and 474 transitions. [2023-12-25 06:05:56,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 06:05:56,137 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 23 states have internal predecessors, (60), 19 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (29), 12 states have call predecessors, (29), 19 states have call successors, (29) Word has length 956 [2023-12-25 06:05:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:05:56,138 INFO L225 Difference]: With dead ends: 249 [2023-12-25 06:05:56,139 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 06:05:56,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1919 GetRequests, 1889 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2023-12-25 06:05:56,140 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:05:56,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 217 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 06:05:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 06:05:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 06:05:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-25 06:05:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 06:05:56,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 956 [2023-12-25 06:05:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:05:56,143 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 06:05:56,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 23 states have internal predecessors, (60), 19 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (29), 12 states have call predecessors, (29), 19 states have call successors, (29) [2023-12-25 06:05:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 06:05:56,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 06:05:56,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:05:56,166 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 06:05:56,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:05:56,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 06:05:56,956 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-12-25 06:05:56,956 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2023-12-25 06:05:56,956 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: true [2023-12-25 06:05:56,957 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (not (= |fibonacci_#in~n| (_ bv1 32))) (= |fibonacci_#in~n| fibonacci_~n) (not (bvslt |fibonacci_#in~n| (_ bv1 32)))) [2023-12-25 06:05:56,957 INFO L895 garLoopResultBuilder]: At program point L22-1(line 22) the Hoare annotation is: (and (not (= |fibonacci_#in~n| (_ bv1 32))) (or (= (_ bv21 32) |fibonacci_#t~ret4|) (not (= |fibonacci_#in~n| (_ bv9 32)))) (let ((.cse2 (= (_ bv4 32) |fibonacci_#in~n|)) (.cse0 (= |fibonacci_#in~n| (_ bv6 32))) (.cse1 (= |fibonacci_#in~n| (_ bv7 32))) (.cse5 (= |fibonacci_#in~n| (_ bv5 32))) (.cse3 (= |fibonacci_#in~n| (_ bv3 32))) (.cse6 (= (_ bv1 32) |fibonacci_#t~ret4|)) (.cse4 (= |fibonacci_#in~n| (_ bv2 32)))) (or (and (= (_ bv5 32) |fibonacci_#t~ret4|) (= (_ bv6 32) fibonacci_~n) .cse0) (and (= (_ bv8 32) |fibonacci_#t~ret4|) .cse1 (= fibonacci_~n (_ bv7 32))) (and (= (_ bv2 32) |fibonacci_#t~ret4|) .cse2 (= (_ bv4 32) fibonacci_~n)) (and (not .cse2) (not .cse3) (not (bvslt fibonacci_~n (_ bv1 32))) (not .cse4) (= |fibonacci_#in~n| fibonacci_~n) (not .cse0) (not .cse5) (not .cse1)) (and (= (_ bv3 32) |fibonacci_#t~ret4|) .cse5 (= fibonacci_~n (_ bv5 32))) (and .cse6 (= (_ bv3 32) fibonacci_~n) .cse3) (and .cse6 (= (_ bv2 32) fibonacci_~n) .cse4))) (or (= (_ bv13 32) |fibonacci_#t~ret4|) (not (= |fibonacci_#in~n| (_ bv8 32))))) [2023-12-25 06:05:56,957 INFO L899 garLoopResultBuilder]: For program point L22-2(line 22) no Hoare annotation was computed. [2023-12-25 06:05:56,957 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2023-12-25 06:05:56,957 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2023-12-25 06:05:56,957 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-12-25 06:05:56,957 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 06:05:56,957 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2023-12-25 06:05:56,957 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (= |ULTIMATE.start_main_~x~0#1| (_ bv9 32)) [2023-12-25 06:05:56,957 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2023-12-25 06:05:56,957 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 35) no Hoare annotation was computed. [2023-12-25 06:05:56,957 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 33) no Hoare annotation was computed. [2023-12-25 06:05:56,957 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 06:05:56,959 INFO L445 BasicCegarLoop]: Path program histogram: [12, 2, 1, 1] [2023-12-25 06:05:56,964 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:05:56,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:05:56 BoogieIcfgContainer [2023-12-25 06:05:56,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:05:56,967 INFO L158 Benchmark]: Toolchain (without parser) took 30592.63ms. Allocated memory was 288.4MB in the beginning and 499.1MB in the end (delta: 210.8MB). Free memory was 235.2MB in the beginning and 440.3MB in the end (delta: -205.2MB). Peak memory consumption was 279.0MB. Max. memory is 8.0GB. [2023-12-25 06:05:56,967 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 224.4MB. Free memory was 173.6MB in the beginning and 173.5MB in the end (delta: 99.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:05:56,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.99ms. Allocated memory is still 288.4MB. Free memory was 234.9MB in the beginning and 224.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:05:56,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.57ms. Allocated memory is still 288.4MB. Free memory was 224.1MB in the beginning and 222.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:05:56,968 INFO L158 Benchmark]: Boogie Preprocessor took 31.14ms. Allocated memory is still 288.4MB. Free memory was 222.6MB in the beginning and 220.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:05:56,968 INFO L158 Benchmark]: RCFGBuilder took 255.56ms. Allocated memory is still 288.4MB. Free memory was 220.9MB in the beginning and 210.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:05:56,968 INFO L158 Benchmark]: TraceAbstraction took 30050.71ms. Allocated memory was 288.4MB in the beginning and 499.1MB in the end (delta: 210.8MB). Free memory was 209.4MB in the beginning and 440.3MB in the end (delta: -230.9MB). Peak memory consumption was 253.9MB. Max. memory is 8.0GB. [2023-12-25 06:05:56,969 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.14ms. Allocated memory is still 224.4MB. Free memory was 173.6MB in the beginning and 173.5MB in the end (delta: 99.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.99ms. Allocated memory is still 288.4MB. Free memory was 234.9MB in the beginning and 224.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.57ms. Allocated memory is still 288.4MB. Free memory was 224.1MB in the beginning and 222.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.14ms. Allocated memory is still 288.4MB. Free memory was 222.6MB in the beginning and 220.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 255.56ms. Allocated memory is still 288.4MB. Free memory was 220.9MB in the beginning and 210.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 30050.71ms. Allocated memory was 288.4MB in the beginning and 499.1MB in the end (delta: 210.8MB). Free memory was 209.4MB in the beginning and 440.3MB in the end (delta: -230.9MB). Peak memory consumption was 253.9MB. 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 - PositiveResult [Line: 33]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.0s, OverallIterations: 16, TraceHistogramMax: 151, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 832 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 729 mSDsluCounter, 2295 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1960 mSDsCounter, 853 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4249 IncrementalHoareTripleChecker+Invalid, 5102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 853 mSolverCounterUnsat, 335 mSDtfsCounter, 4249 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8161 GetRequests, 7829 SyntacticMatches, 7 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=15, InterpolantAutomatonStates: 233, 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, 16 MinimizatonAttempts, 120 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 388 PreInvPairs, 502 NumberOfFragments, 130 HoareAnnotationTreeSize, 388 FormulaSimplifications, 7981 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FormulaSimplificationsInter, 2562 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 4047 NumberOfCodeBlocks, 2930 NumberOfCodeBlocksAsserted, 196 NumberOfCheckSat, 8045 ConstructedInterpolants, 0 QuantifiedInterpolants, 12861 SizeOfPredicates, 71 NumberOfNonLiveVariables, 4261 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 30 InterpolantComputations, 2 PerfectInterpolantSequences, 295705/341258 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-25 06:05:56,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...