/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-simple/fibo_2calls_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:22:31,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:22:31,865 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:22:31,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:22:31,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:22:31,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:22:31,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:22:31,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:22:31,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:22:31,895 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:22:31,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:22:31,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:22:31,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:22:31,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:22:31,898 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:22:31,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:22:31,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:22:31,898 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:22:31,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:22:31,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:22:31,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:22:31,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:22:31,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:22:31,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:22:31,900 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:22:31,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:22:31,900 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:22:31,901 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:22:31,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:22:31,901 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:22:31,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:22:31,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:22:31,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:22:31,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:22:31,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:22:31,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:22:31,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:22:31,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:22:31,902 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:22:31,902 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:22:31,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:22:31,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:22:31,903 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:22:31,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:22:31,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:22:31,903 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:22:31,903 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:22:32,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:22:32,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:22:32,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:22:32,119 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:22:32,120 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:22:32,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2023-12-25 06:22:33,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:22:33,298 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:22:33,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2023-12-25 06:22:33,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c626dc2/747cda4fc19a4459be69da57d66ae968/FLAG68ebaa3ce [2023-12-25 06:22:33,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c626dc2/747cda4fc19a4459be69da57d66ae968 [2023-12-25 06:22:33,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:22:33,321 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:22:33,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:22:33,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:22:33,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:22:33,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43771b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33, skipping insertion in model container [2023-12-25 06:22:33,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,343 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:22:33,450 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-simple/fibo_2calls_5-1.c[946,959] [2023-12-25 06:22:33,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:22:33,466 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:22:33,475 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-simple/fibo_2calls_5-1.c[946,959] [2023-12-25 06:22:33,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:22:33,485 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:22:33,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33 WrapperNode [2023-12-25 06:22:33,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:22:33,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:22:33,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:22:33,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:22:33,490 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:22:33" (1/1) ... [2023-12-25 06:22:33,495 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:22:33" (1/1) ... [2023-12-25 06:22:33,504 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2023-12-25 06:22:33,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:22:33,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:22:33,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:22:33,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:22:33,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,520 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:22:33,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:22:33,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:22:33,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:22:33,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:22:33,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (1/1) ... [2023-12-25 06:22:33,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:22:33,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:22:33,557 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:22:33,559 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:22:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:22:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:22:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-12-25 06:22:33,578 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-12-25 06:22:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-12-25 06:22:33,578 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-12-25 06:22:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:22:33,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:22:33,634 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:22:33,638 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:22:33,789 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:22:33,810 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:22:33,810 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:22:33,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:22:33 BoogieIcfgContainer [2023-12-25 06:22:33,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:22:33,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:22:33,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:22:33,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:22:33,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:22:33" (1/3) ... [2023-12-25 06:22:33,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3591852c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:22:33, skipping insertion in model container [2023-12-25 06:22:33,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:22:33" (2/3) ... [2023-12-25 06:22:33,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3591852c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:22:33, skipping insertion in model container [2023-12-25 06:22:33,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:22:33" (3/3) ... [2023-12-25 06:22:33,819 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2023-12-25 06:22:33,831 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:22:33,833 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:22:33,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:22:33,881 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;@40faf73b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:22:33,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:22:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:22:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 06:22:33,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:33,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:33,892 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:33,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:33,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1178273046, now seen corresponding path program 1 times [2023-12-25 06:22:33,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:33,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233899203] [2023-12-25 06:22:33,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:22:33,908 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:22:33,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:33,910 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:22:33,942 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:22:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:22:33,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:22:33,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:34,060 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:22:34,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:22:34,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:34,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233899203] [2023-12-25 06:22:34,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233899203] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:22:34,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:22:34,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:22:34,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982629852] [2023-12-25 06:22:34,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:22:34,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:22:34,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:34,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:22:34,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:22:34,117 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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:22:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:34,202 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2023-12-25 06:22:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:22:34,204 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:22:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:34,209 INFO L225 Difference]: With dead ends: 32 [2023-12-25 06:22:34,210 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 06:22:34,212 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:22:34,215 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 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.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:34,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:22:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 06:22:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-25 06:22:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 06:22:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 06:22:34,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 9 [2023-12-25 06:22:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:34,248 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 06:22:34,248 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:22:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 06:22:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 06:22:34,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:34,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:34,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 06:22:34,452 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:22:34,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:34,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1422996679, now seen corresponding path program 1 times [2023-12-25 06:22:34,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:34,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484365556] [2023-12-25 06:22:34,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:22:34,455 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:22:34,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:34,456 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:22:34,476 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:22:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:22:34,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:22:34,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:34,526 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:22:34,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:22:34,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:34,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484365556] [2023-12-25 06:22:34,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484365556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:22:34,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:22:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:22:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395544579] [2023-12-25 06:22:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:22:34,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:22:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:22:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:22:34,529 INFO L87 Difference]: Start difference. First operand 24 states and 31 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:22:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:34,594 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2023-12-25 06:22:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:22:34,594 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:22:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:34,595 INFO L225 Difference]: With dead ends: 30 [2023-12-25 06:22:34,595 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 06:22:34,596 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:22:34,598 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:34,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 65 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:22:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 06:22:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-25 06:22:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 06:22:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 06:22:34,609 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 10 [2023-12-25 06:22:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:34,610 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 06:22:34,610 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:22:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 06:22:34,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:22:34,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:34,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:34,617 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:22:34,813 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:22:34,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:34,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1917903498, now seen corresponding path program 1 times [2023-12-25 06:22:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194964809] [2023-12-25 06:22:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:22:34,816 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:22:34,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:34,817 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:22:34,818 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:22:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:22:34,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:22:34,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:22:34,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:22:35,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:35,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194964809] [2023-12-25 06:22:35,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194964809] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:35,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:35,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-25 06:22:35,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318995669] [2023-12-25 06:22:35,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:35,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 06:22:35,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:35,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 06:22:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:22:35,103 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 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:22:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:35,233 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2023-12-25 06:22:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:22:35,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 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 21 [2023-12-25 06:22:35,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:35,234 INFO L225 Difference]: With dead ends: 36 [2023-12-25 06:22:35,235 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 06:22:35,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:22:35,236 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:35,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 65 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:22:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 06:22:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-12-25 06:22:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2023-12-25 06:22:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-25 06:22:35,241 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 21 [2023-12-25 06:22:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:35,241 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-25 06:22:35,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 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:22:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-25 06:22:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 06:22:35,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:35,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:35,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 06:22:35,452 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:22:35,455 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:35,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash -773369340, now seen corresponding path program 1 times [2023-12-25 06:22:35,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:35,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827373836] [2023-12-25 06:22:35,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:22:35,456 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:22:35,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:35,456 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:22:35,457 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:22:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:22:35,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:22:35,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:22:35,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:22:35,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827373836] [2023-12-25 06:22:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827373836] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:35,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:35,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-25 06:22:35,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857875495] [2023-12-25 06:22:35,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:35,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 06:22:35,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:35,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 06:22:35,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:22:35,733 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 10 states have internal predecessors, (23), 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:22:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:35,869 INFO L93 Difference]: Finished difference Result 60 states and 95 transitions. [2023-12-25 06:22:35,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:22:35,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 10 states have internal predecessors, (23), 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:22:35,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:35,875 INFO L225 Difference]: With dead ends: 60 [2023-12-25 06:22:35,875 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 06:22:35,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:22:35,881 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:35,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:22:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 06:22:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-25 06:22:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2023-12-25 06:22:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2023-12-25 06:22:35,897 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 22 [2023-12-25 06:22:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:35,897 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-12-25 06:22:35,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 10 states have internal predecessors, (23), 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:22:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2023-12-25 06:22:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 06:22:35,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:35,899 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:35,905 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:22:36,099 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:22:36,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:36,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1000055446, now seen corresponding path program 1 times [2023-12-25 06:22:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:36,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212369155] [2023-12-25 06:22:36,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:22:36,101 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:22:36,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:36,102 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:22:36,104 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:22:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:22:36,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:22:36,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 06:22:36,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:22:36,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212369155] [2023-12-25 06:22:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212369155] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:36,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:36,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-25 06:22:36,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174472821] [2023-12-25 06:22:36,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:36,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:22:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:36,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:22:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:22:36,611 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 06:22:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:36,843 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2023-12-25 06:22:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:22:36,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) Word has length 33 [2023-12-25 06:22:36,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:36,845 INFO L225 Difference]: With dead ends: 48 [2023-12-25 06:22:36,845 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 06:22:36,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:22:36,846 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:36,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 87 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:22:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 06:22:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2023-12-25 06:22:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (21), 10 states have call predecessors, (21), 8 states have call successors, (21) [2023-12-25 06:22:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2023-12-25 06:22:36,854 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 33 [2023-12-25 06:22:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:36,854 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2023-12-25 06:22:36,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 06:22:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2023-12-25 06:22:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 06:22:36,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:36,855 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:36,858 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:22:37,057 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:22:37,058 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:37,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:37,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1077323161, now seen corresponding path program 1 times [2023-12-25 06:22:37,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:37,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057747902] [2023-12-25 06:22:37,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:22:37,059 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:22:37,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:37,060 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:22:37,062 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:22:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:22:37,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:22:37,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 06:22:37,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:22:37,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:37,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057747902] [2023-12-25 06:22:37,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057747902] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:37,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:37,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-25 06:22:37,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161840468] [2023-12-25 06:22:37,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:37,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:22:37,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:37,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:22:37,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:22:37,370 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 06:22:37,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:37,558 INFO L93 Difference]: Finished difference Result 78 states and 149 transitions. [2023-12-25 06:22:37,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:22:37,558 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) Word has length 34 [2023-12-25 06:22:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:37,559 INFO L225 Difference]: With dead ends: 78 [2023-12-25 06:22:37,559 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 06:22:37,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:22:37,561 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:37,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 126 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:22:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 06:22:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-25 06:22:37,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.16) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 9 states have return successors, (37), 14 states have call predecessors, (37), 10 states have call successors, (37) [2023-12-25 06:22:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 76 transitions. [2023-12-25 06:22:37,569 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 76 transitions. Word has length 34 [2023-12-25 06:22:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:37,569 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 76 transitions. [2023-12-25 06:22:37,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 06:22:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 76 transitions. [2023-12-25 06:22:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 06:22:37,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:37,571 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:37,574 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:22:37,773 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:22:37,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:37,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash -797673590, now seen corresponding path program 2 times [2023-12-25 06:22:37,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:37,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691980208] [2023-12-25 06:22:37,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:22:37,775 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:22:37,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:37,776 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:22:37,776 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:22:37,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:22:37,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:22:37,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:22:37,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 06:22:37,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 06:22:38,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:38,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691980208] [2023-12-25 06:22:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691980208] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:38,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:38,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2023-12-25 06:22:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391445783] [2023-12-25 06:22:38,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:38,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:22:38,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:38,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:22:38,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:22:38,390 INFO L87 Difference]: Start difference. First operand 45 states and 76 transitions. Second operand has 14 states, 12 states have (on average 3.0) internal successors, (36), 14 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 06:22:38,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:38,726 INFO L93 Difference]: Finished difference Result 69 states and 141 transitions. [2023-12-25 06:22:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:22:38,728 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0) internal successors, (36), 14 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) Word has length 45 [2023-12-25 06:22:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:38,729 INFO L225 Difference]: With dead ends: 69 [2023-12-25 06:22:38,729 INFO L226 Difference]: Without dead ends: 65 [2023-12-25 06:22:38,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:22:38,730 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:38,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 140 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:22:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-25 06:22:38,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2023-12-25 06:22:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 2 states have call predecessors, (11), 10 states have return successors, (47), 16 states have call predecessors, (47), 11 states have call successors, (47) [2023-12-25 06:22:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 89 transitions. [2023-12-25 06:22:38,741 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 89 transitions. Word has length 45 [2023-12-25 06:22:38,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:38,742 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 89 transitions. [2023-12-25 06:22:38,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0) internal successors, (36), 14 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 06:22:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 89 transitions. [2023-12-25 06:22:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 06:22:38,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:38,743 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:38,752 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:22:38,952 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:22:38,953 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:38,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1078970546, now seen corresponding path program 1 times [2023-12-25 06:22:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:38,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617426136] [2023-12-25 06:22:38,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:22:38,954 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:22:38,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:38,955 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:22:38,956 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:22:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:22:38,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:22:38,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-25 06:22:39,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 06:22:39,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617426136] [2023-12-25 06:22:39,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617426136] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:39,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:39,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2023-12-25 06:22:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167487437] [2023-12-25 06:22:39,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:39,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:22:39,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:39,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:22:39,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:22:39,311 INFO L87 Difference]: Start difference. First operand 49 states and 89 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 06:22:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:39,484 INFO L93 Difference]: Finished difference Result 107 states and 251 transitions. [2023-12-25 06:22:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:22:39,484 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) Word has length 46 [2023-12-25 06:22:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:39,485 INFO L225 Difference]: With dead ends: 107 [2023-12-25 06:22:39,485 INFO L226 Difference]: Without dead ends: 60 [2023-12-25 06:22:39,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-25 06:22:39,487 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:39,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 181 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:22:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-25 06:22:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-25 06:22:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 2 states have call predecessors, (13), 13 states have return successors, (69), 21 states have call predecessors, (69), 13 states have call successors, (69) [2023-12-25 06:22:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 119 transitions. [2023-12-25 06:22:39,496 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 119 transitions. Word has length 46 [2023-12-25 06:22:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:39,496 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 119 transitions. [2023-12-25 06:22:39,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 06:22:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 119 transitions. [2023-12-25 06:22:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 06:22:39,498 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:39,498 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:39,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-25 06:22:39,710 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:22:39,711 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:39,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash 82175210, now seen corresponding path program 3 times [2023-12-25 06:22:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297608859] [2023-12-25 06:22:39,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:22:39,711 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:22:39,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:39,712 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:22:39,713 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:22:39,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 06:22:39,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:22:39,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:22:39,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-25 06:22:39,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-25 06:22:39,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:39,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297608859] [2023-12-25 06:22:39,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297608859] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:39,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-25 06:22:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415640639] [2023-12-25 06:22:39,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:39,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 06:22:39,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:39,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 06:22:39,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:22:39,976 INFO L87 Difference]: Start difference. First operand 60 states and 119 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 06:22:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:40,092 INFO L93 Difference]: Finished difference Result 82 states and 162 transitions. [2023-12-25 06:22:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:22:40,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 57 [2023-12-25 06:22:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:40,094 INFO L225 Difference]: With dead ends: 82 [2023-12-25 06:22:40,094 INFO L226 Difference]: Without dead ends: 78 [2023-12-25 06:22:40,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:22:40,095 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:40,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 89 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:22:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-25 06:22:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2023-12-25 06:22:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 2 states have call predecessors, (13), 13 states have return successors, (69), 21 states have call predecessors, (69), 13 states have call successors, (69) [2023-12-25 06:22:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 119 transitions. [2023-12-25 06:22:40,105 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 119 transitions. Word has length 57 [2023-12-25 06:22:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:40,106 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 119 transitions. [2023-12-25 06:22:40,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 06:22:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 119 transitions. [2023-12-25 06:22:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 06:22:40,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:40,115 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:40,120 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:22:40,321 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:22:40,321 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:40,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:40,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1783295408, now seen corresponding path program 2 times [2023-12-25 06:22:40,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:40,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666582996] [2023-12-25 06:22:40,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:22:40,322 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:22:40,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:40,323 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:22:40,326 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:22:40,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:22:40,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:22:40,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:22:40,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 06:22:40,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 06:22:41,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:41,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666582996] [2023-12-25 06:22:41,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666582996] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:41,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:41,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2023-12-25 06:22:41,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069935729] [2023-12-25 06:22:41,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:41,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 06:22:41,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:41,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 06:22:41,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-25 06:22:41,078 INFO L87 Difference]: Start difference. First operand 60 states and 119 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 5 states have call predecessors, (14), 12 states have call successors, (14) [2023-12-25 06:22:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:41,587 INFO L93 Difference]: Finished difference Result 162 states and 459 transitions. [2023-12-25 06:22:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 06:22:41,587 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 5 states have call predecessors, (14), 12 states have call successors, (14) Word has length 58 [2023-12-25 06:22:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:41,589 INFO L225 Difference]: With dead ends: 162 [2023-12-25 06:22:41,589 INFO L226 Difference]: Without dead ends: 104 [2023-12-25 06:22:41,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2023-12-25 06:22:41,590 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:41,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 161 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:22:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-25 06:22:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-12-25 06:22:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 20 states have call successors, (20), 5 states have call predecessors, (20), 22 states have return successors, (150), 33 states have call predecessors, (150), 20 states have call successors, (150) [2023-12-25 06:22:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 231 transitions. [2023-12-25 06:22:41,604 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 231 transitions. Word has length 58 [2023-12-25 06:22:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:41,604 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 231 transitions. [2023-12-25 06:22:41,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 5 states have call predecessors, (14), 12 states have call successors, (14) [2023-12-25 06:22:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 231 transitions. [2023-12-25 06:22:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 06:22:41,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:41,606 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:41,611 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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 06:22:41,808 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:22:41,809 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:41,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2115449141, now seen corresponding path program 2 times [2023-12-25 06:22:41,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:41,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685223599] [2023-12-25 06:22:41,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:22:41,809 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:22:41,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:41,810 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:22:41,811 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:22:41,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:22:41,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:22:41,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:22:41,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-25 06:22:41,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 21 proven. 41 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 06:22:42,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685223599] [2023-12-25 06:22:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685223599] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:42,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:42,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2023-12-25 06:22:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228660455] [2023-12-25 06:22:42,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:42,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:22:42,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:22:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:22:42,361 INFO L87 Difference]: Start difference. First operand 98 states and 231 transitions. Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 14 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-25 06:22:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:42,653 INFO L93 Difference]: Finished difference Result 164 states and 546 transitions. [2023-12-25 06:22:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:22:42,654 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 14 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 70 [2023-12-25 06:22:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:42,656 INFO L225 Difference]: With dead ends: 164 [2023-12-25 06:22:42,657 INFO L226 Difference]: Without dead ends: 160 [2023-12-25 06:22:42,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:22:42,657 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:42,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 123 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:22:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-12-25 06:22:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 104. [2023-12-25 06:22:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 63 states have internal predecessors, (65), 20 states have call successors, (20), 5 states have call predecessors, (20), 24 states have return successors, (162), 35 states have call predecessors, (162), 20 states have call successors, (162) [2023-12-25 06:22:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 247 transitions. [2023-12-25 06:22:42,689 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 247 transitions. Word has length 70 [2023-12-25 06:22:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:42,689 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 247 transitions. [2023-12-25 06:22:42,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 14 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-25 06:22:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 247 transitions. [2023-12-25 06:22:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-25 06:22:42,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:42,691 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:42,696 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:22:42,893 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:22:42,894 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:42,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash 961346532, now seen corresponding path program 1 times [2023-12-25 06:22:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:42,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593098415] [2023-12-25 06:22:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:22:42,894 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:22:42,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:42,895 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:22:42,898 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:22:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:22:42,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:22:42,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 29 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-25 06:22:43,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-25 06:22:43,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:43,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593098415] [2023-12-25 06:22:43,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593098415] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:43,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:43,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-25 06:22:43,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947171879] [2023-12-25 06:22:43,317 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:43,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:22:43,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:43,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:22:43,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:22:43,319 INFO L87 Difference]: Start difference. First operand 104 states and 247 transitions. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-25 06:22:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:43,538 INFO L93 Difference]: Finished difference Result 165 states and 488 transitions. [2023-12-25 06:22:43,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:22:43,539 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) Word has length 72 [2023-12-25 06:22:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:43,545 INFO L225 Difference]: With dead ends: 165 [2023-12-25 06:22:43,545 INFO L226 Difference]: Without dead ends: 161 [2023-12-25 06:22:43,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:22:43,546 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:43,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:22:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-25 06:22:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2023-12-25 06:22:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 20 states have call successors, (20), 5 states have call predecessors, (20), 24 states have return successors, (160), 36 states have call predecessors, (160), 20 states have call successors, (160) [2023-12-25 06:22:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 246 transitions. [2023-12-25 06:22:43,583 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 246 transitions. Word has length 72 [2023-12-25 06:22:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:43,584 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 246 transitions. [2023-12-25 06:22:43,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-25 06:22:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 246 transitions. [2023-12-25 06:22:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-25 06:22:43,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:43,587 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:43,605 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:22:43,790 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:22:43,790 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:43,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1409128243, now seen corresponding path program 2 times [2023-12-25 06:22:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:43,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406503181] [2023-12-25 06:22:43,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:22:43,792 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:22:43,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:43,792 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:22:43,793 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:22:43,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:22:43,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:22:43,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:22:43,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-25 06:22:43,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 29 proven. 32 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-25 06:22:44,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:44,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406503181] [2023-12-25 06:22:44,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406503181] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:44,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:44,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-25 06:22:44,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593281140] [2023-12-25 06:22:44,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:44,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:22:44,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:44,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:22:44,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:22:44,054 INFO L87 Difference]: Start difference. First operand 105 states and 246 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-25 06:22:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:44,196 INFO L93 Difference]: Finished difference Result 252 states and 817 transitions. [2023-12-25 06:22:44,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:22:44,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) Word has length 73 [2023-12-25 06:22:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:44,199 INFO L225 Difference]: With dead ends: 252 [2023-12-25 06:22:44,199 INFO L226 Difference]: Without dead ends: 149 [2023-12-25 06:22:44,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:22:44,201 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:44,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 126 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:22:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-25 06:22:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2023-12-25 06:22:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.088235294117647) internal successors, (74), 71 states have internal predecessors, (74), 23 states have call successors, (23), 5 states have call predecessors, (23), 28 states have return successors, (216), 43 states have call predecessors, (216), 23 states have call successors, (216) [2023-12-25 06:22:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 313 transitions. [2023-12-25 06:22:44,220 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 313 transitions. Word has length 73 [2023-12-25 06:22:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:44,220 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 313 transitions. [2023-12-25 06:22:44,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-25 06:22:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 313 transitions. [2023-12-25 06:22:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-25 06:22:44,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:44,223 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:44,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-25 06:22:44,426 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:22:44,426 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:44,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1607563537, now seen corresponding path program 1 times [2023-12-25 06:22:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505814806] [2023-12-25 06:22:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:22:44,427 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:22:44,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:44,428 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:22:44,430 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:22:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:22:44,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:22:44,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 82 proven. 109 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2023-12-25 06:22:44,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 82 proven. 114 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2023-12-25 06:22:44,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:44,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505814806] [2023-12-25 06:22:44,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505814806] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:44,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:44,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2023-12-25 06:22:44,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517457190] [2023-12-25 06:22:44,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:44,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 06:22:44,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:44,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 06:22:44,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 06:22:44,964 INFO L87 Difference]: Start difference. First operand 120 states and 313 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-25 06:22:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:45,135 INFO L93 Difference]: Finished difference Result 197 states and 579 transitions. [2023-12-25 06:22:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:22:45,136 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) Word has length 147 [2023-12-25 06:22:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:45,138 INFO L225 Difference]: With dead ends: 197 [2023-12-25 06:22:45,138 INFO L226 Difference]: Without dead ends: 171 [2023-12-25 06:22:45,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:22:45,139 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:45,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 94 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:22:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-25 06:22:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 127. [2023-12-25 06:22:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 24 states have call successors, (24), 7 states have call predecessors, (24), 28 states have return successors, (217), 43 states have call predecessors, (217), 24 states have call successors, (217) [2023-12-25 06:22:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 324 transitions. [2023-12-25 06:22:45,160 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 324 transitions. Word has length 147 [2023-12-25 06:22:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:45,160 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 324 transitions. [2023-12-25 06:22:45,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-25 06:22:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 324 transitions. [2023-12-25 06:22:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 06:22:45,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:45,162 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:45,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-25 06:22:45,365 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:22:45,366 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:45,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash -681928779, now seen corresponding path program 2 times [2023-12-25 06:22:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:45,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457104010] [2023-12-25 06:22:45,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:22:45,366 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:22:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:45,367 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:22:45,396 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:22:45,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:22:45,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:22:45,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:22:45,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 95 proven. 36 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-12-25 06:22:45,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 95 proven. 41 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2023-12-25 06:22:45,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:45,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457104010] [2023-12-25 06:22:45,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457104010] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:45,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:45,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2023-12-25 06:22:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612206606] [2023-12-25 06:22:45,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:45,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 06:22:45,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:45,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 06:22:45,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 06:22:45,821 INFO L87 Difference]: Start difference. First operand 127 states and 324 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-25 06:22:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:45,977 INFO L93 Difference]: Finished difference Result 149 states and 381 transitions. [2023-12-25 06:22:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:22:45,977 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) Word has length 111 [2023-12-25 06:22:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:45,979 INFO L225 Difference]: With dead ends: 149 [2023-12-25 06:22:45,979 INFO L226 Difference]: Without dead ends: 145 [2023-12-25 06:22:45,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:22:45,980 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:45,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 96 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:22:45,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-25 06:22:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2023-12-25 06:22:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 24 states have call successors, (24), 7 states have call predecessors, (24), 28 states have return successors, (217), 43 states have call predecessors, (217), 24 states have call successors, (217) [2023-12-25 06:22:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 324 transitions. [2023-12-25 06:22:45,993 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 324 transitions. Word has length 111 [2023-12-25 06:22:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:45,993 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 324 transitions. [2023-12-25 06:22:45,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-25 06:22:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 324 transitions. [2023-12-25 06:22:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-25 06:22:45,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:45,995 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:45,998 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:22:46,197 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:22:46,198 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:46,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash -849286803, now seen corresponding path program 3 times [2023-12-25 06:22:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:46,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347105935] [2023-12-25 06:22:46,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:22:46,199 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:22:46,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:46,200 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:22:46,200 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:22:46,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 06:22:46,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:22:46,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 06:22:46,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 92 proven. 5 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-12-25 06:22:46,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 92 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-25 06:22:46,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:46,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347105935] [2023-12-25 06:22:46,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347105935] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:46,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:46,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-25 06:22:46,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774912149] [2023-12-25 06:22:46,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:46,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:22:46,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:46,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:22:46,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:22:46,578 INFO L87 Difference]: Start difference. First operand 127 states and 324 transitions. Second operand has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2023-12-25 06:22:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:46,826 INFO L93 Difference]: Finished difference Result 247 states and 785 transitions. [2023-12-25 06:22:46,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:22:46,827 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 97 [2023-12-25 06:22:46,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:46,828 INFO L225 Difference]: With dead ends: 247 [2023-12-25 06:22:46,828 INFO L226 Difference]: Without dead ends: 129 [2023-12-25 06:22:46,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-12-25 06:22:46,830 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:46,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 104 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:22:46,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-25 06:22:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2023-12-25 06:22:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 70 states have internal predecessors, (77), 23 states have call successors, (23), 7 states have call predecessors, (23), 25 states have return successors, (174), 39 states have call predecessors, (174), 23 states have call successors, (174) [2023-12-25 06:22:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 274 transitions. [2023-12-25 06:22:46,841 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 274 transitions. Word has length 97 [2023-12-25 06:22:46,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:46,841 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 274 transitions. [2023-12-25 06:22:46,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2023-12-25 06:22:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 274 transitions. [2023-12-25 06:22:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 06:22:46,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:46,843 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:46,845 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:22:47,045 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:22:47,046 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:47,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1714529634, now seen corresponding path program 4 times [2023-12-25 06:22:47,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:47,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082700596] [2023-12-25 06:22:47,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:22:47,047 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:22:47,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:47,048 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:22:47,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 06:22:47,105 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:22:47,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:22:47,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-25 06:22:47,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-25 06:22:47,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-25 06:22:47,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:47,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082700596] [2023-12-25 06:22:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082700596] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:47,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:47,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2023-12-25 06:22:47,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807315309] [2023-12-25 06:22:47,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:47,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 06:22:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:47,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 06:22:47,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2023-12-25 06:22:47,875 INFO L87 Difference]: Start difference. First operand 117 states and 274 transitions. Second operand has 28 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 11 states have internal predecessors, (34), 5 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (17), 17 states have call predecessors, (17), 5 states have call successors, (17) [2023-12-25 06:22:48,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:48,133 INFO L93 Difference]: Finished difference Result 178 states and 522 transitions. [2023-12-25 06:22:48,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 06:22:48,133 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 11 states have internal predecessors, (34), 5 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (17), 17 states have call predecessors, (17), 5 states have call successors, (17) Word has length 98 [2023-12-25 06:22:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:48,136 INFO L225 Difference]: With dead ends: 178 [2023-12-25 06:22:48,136 INFO L226 Difference]: Without dead ends: 174 [2023-12-25 06:22:48,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2023-12-25 06:22:48,137 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:48,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1137 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:22:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-25 06:22:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 138. [2023-12-25 06:22:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 82 states have internal predecessors, (88), 27 states have call successors, (27), 7 states have call predecessors, (27), 31 states have return successors, (255), 48 states have call predecessors, (255), 27 states have call successors, (255) [2023-12-25 06:22:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 370 transitions. [2023-12-25 06:22:48,151 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 370 transitions. Word has length 98 [2023-12-25 06:22:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:48,151 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 370 transitions. [2023-12-25 06:22:48,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 11 states have internal predecessors, (34), 5 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (17), 17 states have call predecessors, (17), 5 states have call successors, (17) [2023-12-25 06:22:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 370 transitions. [2023-12-25 06:22:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-25 06:22:48,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:48,154 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:48,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 06:22:48,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:22:48,357 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:48,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash -985857346, now seen corresponding path program 5 times [2023-12-25 06:22:48,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:48,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069796505] [2023-12-25 06:22:48,358 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:22:48,358 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:22:48,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:48,359 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:22:48,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 06:22:48,431 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-12-25 06:22:48,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:22:48,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 06:22:48,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 79 proven. 113 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-12-25 06:22:48,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 78 proven. 126 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-25 06:22:49,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:49,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069796505] [2023-12-25 06:22:49,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069796505] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:49,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:49,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 25 [2023-12-25 06:22:49,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135706901] [2023-12-25 06:22:49,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:49,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 06:22:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 06:22:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2023-12-25 06:22:49,587 INFO L87 Difference]: Start difference. First operand 138 states and 370 transitions. Second operand has 25 states, 22 states have (on average 3.0) internal successors, (66), 23 states have internal predecessors, (66), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) [2023-12-25 06:22:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:50,651 INFO L93 Difference]: Finished difference Result 331 states and 1214 transitions. [2023-12-25 06:22:50,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 06:22:50,652 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.0) internal successors, (66), 23 states have internal predecessors, (66), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) Word has length 110 [2023-12-25 06:22:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:50,657 INFO L225 Difference]: With dead ends: 331 [2023-12-25 06:22:50,657 INFO L226 Difference]: Without dead ends: 190 [2023-12-25 06:22:50,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 06:22:50,662 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 56 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:50,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 403 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 06:22:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-25 06:22:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 164. [2023-12-25 06:22:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 96 states have internal predecessors, (105), 35 states have call successors, (35), 11 states have call predecessors, (35), 34 states have return successors, (219), 56 states have call predecessors, (219), 35 states have call successors, (219) [2023-12-25 06:22:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 359 transitions. [2023-12-25 06:22:50,690 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 359 transitions. Word has length 110 [2023-12-25 06:22:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:50,691 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 359 transitions. [2023-12-25 06:22:50,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.0) internal successors, (66), 23 states have internal predecessors, (66), 18 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) [2023-12-25 06:22:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 359 transitions. [2023-12-25 06:22:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-25 06:22:50,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:50,694 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:50,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-25 06:22:50,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:22:50,898 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:50,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash 342708316, now seen corresponding path program 6 times [2023-12-25 06:22:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:50,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334494776] [2023-12-25 06:22:50,899 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:22:50,899 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:22:50,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:50,909 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 06:22:50,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 06:22:50,997 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-12-25 06:22:50,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:22:51,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:22:51,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 40 proven. 87 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-12-25 06:22:51,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 40 proven. 92 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-25 06:22:51,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:51,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334494776] [2023-12-25 06:22:51,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334494776] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:51,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:51,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2023-12-25 06:22:51,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062793561] [2023-12-25 06:22:51,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:51,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 06:22:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:51,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 06:22:51,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 06:22:51,466 INFO L87 Difference]: Start difference. First operand 164 states and 359 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-25 06:22:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:51,657 INFO L93 Difference]: Finished difference Result 218 states and 600 transitions. [2023-12-25 06:22:51,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:22:51,658 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) Word has length 109 [2023-12-25 06:22:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:51,660 INFO L225 Difference]: With dead ends: 218 [2023-12-25 06:22:51,660 INFO L226 Difference]: Without dead ends: 204 [2023-12-25 06:22:51,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:22:51,662 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:51,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:22:51,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-25 06:22:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 161. [2023-12-25 06:22:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 94 states have internal predecessors, (103), 35 states have call successors, (35), 11 states have call predecessors, (35), 33 states have return successors, (214), 55 states have call predecessors, (214), 35 states have call successors, (214) [2023-12-25 06:22:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 352 transitions. [2023-12-25 06:22:51,679 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 352 transitions. Word has length 109 [2023-12-25 06:22:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:51,679 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 352 transitions. [2023-12-25 06:22:51,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-25 06:22:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 352 transitions. [2023-12-25 06:22:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-25 06:22:51,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:22:51,681 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:22:51,684 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 (20)] Ended with exit code 0 [2023-12-25 06:22:51,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:22:51,885 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:22:51,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:22:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1850819850, now seen corresponding path program 7 times [2023-12-25 06:22:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:22:51,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412052224] [2023-12-25 06:22:51,885 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:22:51,885 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:22:51,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:22:51,886 INFO L229 MonitoredProcess]: Starting monitored process 21 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:22:51,902 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 (21)] Waiting until timeout for monitored process [2023-12-25 06:22:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:22:51,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:22:51,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:22:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 43 proven. 129 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2023-12-25 06:22:52,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:22:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 43 proven. 139 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2023-12-25 06:22:52,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:22:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412052224] [2023-12-25 06:22:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412052224] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:22:52,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:22:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 15 [2023-12-25 06:22:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41723099] [2023-12-25 06:22:52,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:22:52,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 06:22:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:22:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 06:22:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:22:52,499 INFO L87 Difference]: Start difference. First operand 161 states and 352 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 13 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 7 states have call predecessors, (19), 13 states have call successors, (19) [2023-12-25 06:22:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:22:52,701 INFO L93 Difference]: Finished difference Result 324 states and 737 transitions. [2023-12-25 06:22:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 06:22:52,701 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 13 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 7 states have call predecessors, (19), 13 states have call successors, (19) Word has length 122 [2023-12-25 06:22:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:22:52,702 INFO L225 Difference]: With dead ends: 324 [2023-12-25 06:22:52,702 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 06:22:52,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2023-12-25 06:22:52,705 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:22:52,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 69 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:22:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 06:22:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 06:22:52,705 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:22:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 06:22:52,705 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122 [2023-12-25 06:22:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:22:52,705 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 06:22:52,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 13 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 7 states have call predecessors, (19), 13 states have call successors, (19) [2023-12-25 06:22:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 06:22:52,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 06:22:52,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:22:52,711 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 (21)] Forceful destruction successful, exit code 0 [2023-12-25 06:22:52,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:22:52,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 06:22:55,495 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 06:22:55,495 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2023-12-25 06:22:55,496 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 06:22:55,496 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2023-12-25 06:22:55,496 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-12-25 06:22:55,496 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (= |ULTIMATE.start_main_~x~0#1| (_ bv5 32)) [2023-12-25 06:22:55,496 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2023-12-25 06:22:55,496 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2023-12-25 06:22:55,496 INFO L899 garLoopResultBuilder]: For program point fibo2FINAL(lines 19 27) no Hoare annotation was computed. [2023-12-25 06:22:55,496 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 19 27) the Hoare annotation is: true [2023-12-25 06:22:55,496 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (= |fibo2_#in~n| fibo2_~n) (not (= |fibo2_#in~n| (_ bv1 32))) (not (bvslt fibo2_~n (_ bv1 32)))) [2023-12-25 06:22:55,496 INFO L895 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse1 (= |fibo2_#t~ret6| (_ bv1 32))) (.cse0 (= (_ bv4 32) |fibo2_#in~n|))) (or (and .cse0 (= (_ bv4 32) fibo2_~n) (= (_ bv2 32) |fibo2_#t~ret6|)) (and (= (_ bv3 32) |fibo2_#in~n|) (= (_ bv3 32) fibo2_~n) .cse1) (and (= (_ bv2 32) fibo2_~n) (= (_ bv2 32) |fibo2_#in~n|) .cse1) (and (not .cse0) (= |fibo2_#in~n| fibo2_~n) (not (bvslt (bvadd (_ bv4294967293 32) |fibo2_#in~n|) (_ bv1 32))) (not (bvslt fibo2_~n (_ bv1 32)))))) [2023-12-25 06:22:55,496 INFO L899 garLoopResultBuilder]: For program point fibo2EXIT(lines 19 27) no Hoare annotation was computed. [2023-12-25 06:22:55,497 INFO L899 garLoopResultBuilder]: For program point L25-2(line 25) no Hoare annotation was computed. [2023-12-25 06:22:55,497 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 26) no Hoare annotation was computed. [2023-12-25 06:22:55,497 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 26) no Hoare annotation was computed. [2023-12-25 06:22:55,497 INFO L895 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (and (not (bvslt fibo1_~n (_ bv1 32))) (not (= (_ bv1 32) fibo1_~n)) (= |fibo1_#in~n| fibo1_~n)) [2023-12-25 06:22:55,497 INFO L895 garLoopResultBuilder]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse1 (= |fibo1_#in~n| (_ bv3 32))) (.cse2 (= |fibo1_#in~n| (_ bv5 32))) (.cse0 (= |fibo1_#t~ret4| (_ bv1 32))) (.cse3 (= |fibo1_#in~n| (_ bv2 32)))) (or (and (= (_ bv3 32) fibo1_~n) .cse0 .cse1) (and (= |fibo1_#t~ret4| (_ bv3 32)) (= (_ bv5 32) fibo1_~n) .cse2) (and (not .cse1) (not .cse2) (not (bvslt (bvadd |fibo1_#in~n| (_ bv4294967295 32)) (_ bv1 32))) (not (bvslt fibo1_~n (_ bv1 32))) (not .cse3) (= |fibo1_#in~n| fibo1_~n)) (and .cse0 .cse3 (= (_ bv2 32) fibo1_~n)))) [2023-12-25 06:22:55,497 INFO L899 garLoopResultBuilder]: For program point L15-2(line 15) no Hoare annotation was computed. [2023-12-25 06:22:55,497 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 16) no Hoare annotation was computed. [2023-12-25 06:22:55,497 INFO L899 garLoopResultBuilder]: For program point fibo1FINAL(lines 9 17) no Hoare annotation was computed. [2023-12-25 06:22:55,497 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 16) no Hoare annotation was computed. [2023-12-25 06:22:55,497 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 17) the Hoare annotation is: true [2023-12-25 06:22:55,497 INFO L899 garLoopResultBuilder]: For program point fibo1EXIT(lines 9 17) no Hoare annotation was computed. [2023-12-25 06:22:55,499 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 2, 2, 1, 1, 1, 1] [2023-12-25 06:22:55,500 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:22:55,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:22:55 BoogieIcfgContainer [2023-12-25 06:22:55,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:22:55,503 INFO L158 Benchmark]: Toolchain (without parser) took 22182.58ms. Allocated memory was 206.6MB in the beginning and 431.0MB in the end (delta: 224.4MB). Free memory was 162.5MB in the beginning and 317.8MB in the end (delta: -155.3MB). Peak memory consumption was 242.4MB. Max. memory is 8.0GB. [2023-12-25 06:22:55,503 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 206.6MB. Free memory is still 164.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:22:55,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.70ms. Allocated memory is still 206.6MB. Free memory was 162.5MB in the beginning and 151.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:22:55,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.86ms. Allocated memory is still 206.6MB. Free memory was 151.3MB in the beginning and 149.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:22:55,504 INFO L158 Benchmark]: Boogie Preprocessor took 21.71ms. Allocated memory is still 206.6MB. Free memory was 149.9MB in the beginning and 148.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:22:55,504 INFO L158 Benchmark]: RCFGBuilder took 282.88ms. Allocated memory is still 206.6MB. Free memory was 148.2MB in the beginning and 136.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 06:22:55,504 INFO L158 Benchmark]: TraceAbstraction took 21690.97ms. Allocated memory was 206.6MB in the beginning and 431.0MB in the end (delta: 224.4MB). Free memory was 136.0MB in the beginning and 317.8MB in the end (delta: -181.9MB). Peak memory consumption was 216.2MB. Max. memory is 8.0GB. [2023-12-25 06:22:55,505 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.48ms. Allocated memory is still 206.6MB. Free memory is still 164.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 162.70ms. Allocated memory is still 206.6MB. Free memory was 162.5MB in the beginning and 151.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.86ms. Allocated memory is still 206.6MB. Free memory was 151.3MB in the beginning and 149.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.71ms. Allocated memory is still 206.6MB. Free memory was 149.9MB in the beginning and 148.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 282.88ms. Allocated memory is still 206.6MB. Free memory was 148.2MB in the beginning and 136.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 21690.97ms. Allocated memory was 206.6MB in the beginning and 431.0MB in the end (delta: 224.4MB). Free memory was 136.0MB in the beginning and 317.8MB in the end (delta: -181.9MB). Peak memory consumption was 216.2MB. 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: 41]: 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 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 488 mSDsluCounter, 3408 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2996 mSDsCounter, 284 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3871 IncrementalHoareTripleChecker+Invalid, 4155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 284 mSolverCounterUnsat, 412 mSDtfsCounter, 3871 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2750 GetRequests, 2434 SyntacticMatches, 0 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=18, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 378 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 529 PreInvPairs, 1625 NumberOfFragments, 135 HoareAnnotationTreeSize, 529 FormulaSimplifications, 208210 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 7 FormulaSimplificationsInter, 8181 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1344 NumberOfCodeBlocks, 1249 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2631 ConstructedInterpolants, 0 QuantifiedInterpolants, 6281 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1965 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 4770/6368 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:22:55,527 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...