/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-52.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-05 23:16:59,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 23:16:59,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 23:16:59,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 23:16:59,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 23:16:59,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 23:16:59,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 23:16:59,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 23:16:59,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 23:16:59,453 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 23:16:59,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 23:16:59,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 23:16:59,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 23:16:59,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 23:16:59,455 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 23:16:59,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 23:16:59,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 23:16:59,456 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 23:16:59,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 23:16:59,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 23:16:59,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 23:16:59,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 23:16:59,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 23:16:59,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 23:16:59,459 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 23:16:59,459 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 23:16:59,459 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 23:16:59,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 23:16:59,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 23:16:59,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 23:16:59,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 23:16:59,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 23:16:59,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 23:16:59,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 23:16:59,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:16:59,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 23:16:59,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 23:16:59,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 23:16:59,462 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 23:16:59,463 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 23:16:59,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 23:16:59,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 23:16:59,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 23:16:59,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 23:16:59,464 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-05 23:16:59,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 23:16:59,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 23:16:59,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 23:16:59,724 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 23:16:59,725 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 23:16:59,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-52.i [2024-11-05 23:17:01,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 23:17:01,334 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 23:17:01,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-52.i [2024-11-05 23:17:01,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f343caf80/e56748dc968d4e80a0dc80d6e1a2d222/FLAGeea53eb90 [2024-11-05 23:17:01,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f343caf80/e56748dc968d4e80a0dc80d6e1a2d222 [2024-11-05 23:17:01,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 23:17:01,358 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 23:17:01,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 23:17:01,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 23:17:01,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 23:17:01,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55247bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01, skipping insertion in model container [2024-11-05 23:17:01,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 23:17:01,538 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-52.i[915,928] [2024-11-05 23:17:01,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:17:01,567 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 23:17:01,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-52.i[915,928] [2024-11-05 23:17:01,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:17:01,603 INFO L204 MainTranslator]: Completed translation [2024-11-05 23:17:01,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01 WrapperNode [2024-11-05 23:17:01,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 23:17:01,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 23:17:01,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 23:17:01,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 23:17:01,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,638 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 62 [2024-11-05 23:17:01,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 23:17:01,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 23:17:01,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 23:17:01,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 23:17:01,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,664 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]. [2024-11-05 23:17:01,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 23:17:01,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 23:17:01,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 23:17:01,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 23:17:01,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (1/1) ... [2024-11-05 23:17:01,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:17:01,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 23:17:01,718 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) [2024-11-05 23:17:01,722 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 [2024-11-05 23:17:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 23:17:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 23:17:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 23:17:01,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 23:17:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 23:17:01,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 23:17:01,828 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 23:17:01,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 23:17:02,071 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-05 23:17:02,072 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 23:17:02,087 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 23:17:02,087 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 23:17:02,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:17:02 BoogieIcfgContainer [2024-11-05 23:17:02,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 23:17:02,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 23:17:02,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 23:17:02,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 23:17:02,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:17:01" (1/3) ... [2024-11-05 23:17:02,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1af381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:17:02, skipping insertion in model container [2024-11-05 23:17:02,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:17:01" (2/3) ... [2024-11-05 23:17:02,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1af381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:17:02, skipping insertion in model container [2024-11-05 23:17:02,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:17:02" (3/3) ... [2024-11-05 23:17:02,099 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-52.i [2024-11-05 23:17:02,116 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 23:17:02,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 23:17:02,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 23:17:02,188 INFO L333 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, 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;@3d6e5033, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 23:17:02,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 23:17:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-05 23:17:02,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-05 23:17:02,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:02,201 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:02,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:02,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash -491160644, now seen corresponding path program 1 times [2024-11-05 23:17:02,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:02,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741499526] [2024-11-05 23:17:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:02,222 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 [2024-11-05 23:17:02,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:02,226 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) [2024-11-05 23:17:02,228 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 [2024-11-05 23:17:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:02,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 23:17:02,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-05 23:17:02,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:02,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741499526] [2024-11-05 23:17:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741499526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:02,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:02,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 23:17:02,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745524632] [2024-11-05 23:17:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:02,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 23:17:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:02,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 23:17:02,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:17:02,420 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-05 23:17:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:02,436 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2024-11-05 23:17:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 23:17:02,454 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-11-05 23:17:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:02,464 INFO L225 Difference]: With dead ends: 57 [2024-11-05 23:17:02,465 INFO L226 Difference]: Without dead ends: 28 [2024-11-05 23:17:02,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:17:02,473 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:02,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 23:17:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-05 23:17:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-05 23:17:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-05 23:17:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-05 23:17:02,507 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 45 [2024-11-05 23:17:02,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:02,507 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-05 23:17:02,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-05 23:17:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-11-05 23:17:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-05 23:17:02,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:02,510 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:02,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 23:17:02,714 WARN L453 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 [2024-11-05 23:17:02,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:02,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash 229172476, now seen corresponding path program 1 times [2024-11-05 23:17:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:02,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965693470] [2024-11-05 23:17:02,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:02,717 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 [2024-11-05 23:17:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:02,721 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) [2024-11-05 23:17:02,723 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 [2024-11-05 23:17:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:02,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 23:17:02,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-05 23:17:03,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:03,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:03,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965693470] [2024-11-05 23:17:03,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965693470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:03,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:03,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-05 23:17:03,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798003824] [2024-11-05 23:17:03,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:03,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 23:17:03,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:03,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 23:17:03,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 23:17:03,342 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:03,527 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-11-05 23:17:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 23:17:03,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-11-05 23:17:03,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:03,529 INFO L225 Difference]: With dead ends: 45 [2024-11-05 23:17:03,529 INFO L226 Difference]: Without dead ends: 43 [2024-11-05 23:17:03,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:17:03,531 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:03,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 129 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 23:17:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-05 23:17:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2024-11-05 23:17:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-05 23:17:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-05 23:17:03,544 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 45 [2024-11-05 23:17:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-05 23:17:03,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-05 23:17:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-05 23:17:03,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:03,551 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:03,557 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 [2024-11-05 23:17:03,755 WARN L453 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 [2024-11-05 23:17:03,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:03,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:03,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2004179838, now seen corresponding path program 1 times [2024-11-05 23:17:03,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:03,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327109218] [2024-11-05 23:17:03,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:03,758 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 [2024-11-05 23:17:03,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:03,761 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) [2024-11-05 23:17:03,762 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 [2024-11-05 23:17:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:03,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 23:17:03,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-05 23:17:03,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:03,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:03,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327109218] [2024-11-05 23:17:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327109218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:03,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:03,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-05 23:17:03,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687045006] [2024-11-05 23:17:03,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:03,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 23:17:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:03,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 23:17:03,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 23:17:03,949 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:04,092 INFO L93 Difference]: Finished difference Result 98 states and 124 transitions. [2024-11-05 23:17:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 23:17:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-11-05 23:17:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:04,097 INFO L225 Difference]: With dead ends: 98 [2024-11-05 23:17:04,097 INFO L226 Difference]: Without dead ends: 68 [2024-11-05 23:17:04,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-05 23:17:04,099 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:04,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 90 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 23:17:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-05 23:17:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-11-05 23:17:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-05 23:17:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2024-11-05 23:17:04,113 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 45 [2024-11-05 23:17:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:04,114 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2024-11-05 23:17:04,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:04,116 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-11-05 23:17:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-05 23:17:04,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:04,117 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:04,122 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 [2024-11-05 23:17:04,318 WARN L453 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 [2024-11-05 23:17:04,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:04,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:04,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1721148166, now seen corresponding path program 1 times [2024-11-05 23:17:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:04,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218690171] [2024-11-05 23:17:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:04,320 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 [2024-11-05 23:17:04,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:04,323 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) [2024-11-05 23:17:04,324 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 [2024-11-05 23:17:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:04,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 23:17:04,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-05 23:17:04,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:04,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:04,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218690171] [2024-11-05 23:17:04,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218690171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:04,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:04,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-05 23:17:04,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524425099] [2024-11-05 23:17:04,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:04,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 23:17:04,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 23:17:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 23:17:04,723 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:04,916 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2024-11-05 23:17:04,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 23:17:04,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-11-05 23:17:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:04,924 INFO L225 Difference]: With dead ends: 75 [2024-11-05 23:17:04,924 INFO L226 Difference]: Without dead ends: 73 [2024-11-05 23:17:04,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:17:04,928 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:04,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:17:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-05 23:17:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2024-11-05 23:17:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-05 23:17:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2024-11-05 23:17:04,942 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 46 [2024-11-05 23:17:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:04,944 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2024-11-05 23:17:04,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2024-11-05 23:17:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-05 23:17:04,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:04,947 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:04,952 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 [2024-11-05 23:17:05,148 WARN L453 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 [2024-11-05 23:17:05,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:05,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1719301124, now seen corresponding path program 1 times [2024-11-05 23:17:05,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:05,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966451487] [2024-11-05 23:17:05,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:05,150 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 [2024-11-05 23:17:05,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:05,153 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) [2024-11-05 23:17:05,155 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 [2024-11-05 23:17:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:05,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-05 23:17:05,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-05 23:17:05,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:05,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:05,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966451487] [2024-11-05 23:17:05,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966451487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:05,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-05 23:17:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515462429] [2024-11-05 23:17:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:05,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 23:17:05,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:05,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 23:17:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-05 23:17:05,591 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:05,906 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-11-05 23:17:05,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 23:17:05,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-11-05 23:17:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:05,909 INFO L225 Difference]: With dead ends: 81 [2024-11-05 23:17:05,909 INFO L226 Difference]: Without dead ends: 79 [2024-11-05 23:17:05,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-05 23:17:05,911 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 35 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:05,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 255 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:17:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-05 23:17:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2024-11-05 23:17:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-05 23:17:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-11-05 23:17:05,928 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 46 [2024-11-05 23:17:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:05,930 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-11-05 23:17:05,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-11-05 23:17:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-05 23:17:05,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:05,932 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:05,939 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 [2024-11-05 23:17:06,132 WARN L453 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 [2024-11-05 23:17:06,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:06,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash -48075784, now seen corresponding path program 1 times [2024-11-05 23:17:06,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:06,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869339703] [2024-11-05 23:17:06,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:06,134 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 [2024-11-05 23:17:06,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:06,136 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) [2024-11-05 23:17:06,137 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 [2024-11-05 23:17:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:06,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 23:17:06,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-05 23:17:06,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:06,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:06,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869339703] [2024-11-05 23:17:06,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869339703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:06,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:06,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-05 23:17:06,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178678268] [2024-11-05 23:17:06,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:06,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 23:17:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:06,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 23:17:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 23:17:06,550 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:06,832 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2024-11-05 23:17:06,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 23:17:06,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 88 [2024-11-05 23:17:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:06,835 INFO L225 Difference]: With dead ends: 71 [2024-11-05 23:17:06,835 INFO L226 Difference]: Without dead ends: 69 [2024-11-05 23:17:06,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:17:06,836 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:06,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 156 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:17:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-05 23:17:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2024-11-05 23:17:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-05 23:17:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-11-05 23:17:06,845 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 88 [2024-11-05 23:17:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:06,845 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-11-05 23:17:06,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-11-05 23:17:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-05 23:17:06,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:06,847 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:06,852 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 (7)] Ended with exit code 0 [2024-11-05 23:17:07,047 WARN L453 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 [2024-11-05 23:17:07,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:07,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:07,048 INFO L85 PathProgramCache]: Analyzing trace with hash -914715966, now seen corresponding path program 1 times [2024-11-05 23:17:07,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:07,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932151544] [2024-11-05 23:17:07,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:07,049 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 [2024-11-05 23:17:07,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:07,052 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) [2024-11-05 23:17:07,054 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 [2024-11-05 23:17:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:07,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 23:17:07,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-05 23:17:07,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:07,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:07,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932151544] [2024-11-05 23:17:07,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932151544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:07,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:07,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-05 23:17:07,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420162270] [2024-11-05 23:17:07,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:07,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 23:17:07,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 23:17:07,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 23:17:07,468 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:07,860 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2024-11-05 23:17:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 23:17:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 89 [2024-11-05 23:17:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:07,861 INFO L225 Difference]: With dead ends: 76 [2024-11-05 23:17:07,861 INFO L226 Difference]: Without dead ends: 74 [2024-11-05 23:17:07,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-05 23:17:07,862 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:07,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 180 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 23:17:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-05 23:17:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2024-11-05 23:17:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-05 23:17:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-11-05 23:17:07,875 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 89 [2024-11-05 23:17:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:07,875 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-11-05 23:17:07,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-11-05 23:17:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-05 23:17:07,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:07,877 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:07,884 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 [2024-11-05 23:17:08,080 WARN L453 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 [2024-11-05 23:17:08,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:08,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1725909634, now seen corresponding path program 1 times [2024-11-05 23:17:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631119022] [2024-11-05 23:17:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:08,082 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 [2024-11-05 23:17:08,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:08,084 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) [2024-11-05 23:17:08,086 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 [2024-11-05 23:17:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:08,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 23:17:08,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-05 23:17:08,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:17:08,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:08,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631119022] [2024-11-05 23:17:08,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631119022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:17:08,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:17:08,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-05 23:17:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049700784] [2024-11-05 23:17:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:17:08,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 23:17:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 23:17:08,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 23:17:08,517 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:08,750 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2024-11-05 23:17:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 23:17:08,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 89 [2024-11-05 23:17:08,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:08,753 INFO L225 Difference]: With dead ends: 69 [2024-11-05 23:17:08,753 INFO L226 Difference]: Without dead ends: 67 [2024-11-05 23:17:08,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:17:08,754 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:08,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:17:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-05 23:17:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2024-11-05 23:17:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-05 23:17:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-11-05 23:17:08,763 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 89 [2024-11-05 23:17:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:08,763 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-11-05 23:17:08,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-05 23:17:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-11-05 23:17:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-05 23:17:08,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:17:08,764 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:08,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-05 23:17:08,965 WARN L453 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 [2024-11-05 23:17:08,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:17:08,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:17:08,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1724062592, now seen corresponding path program 1 times [2024-11-05 23:17:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:17:08,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440296523] [2024-11-05 23:17:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:08,967 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 [2024-11-05 23:17:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:17:08,968 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) [2024-11-05 23:17:08,969 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 [2024-11-05 23:17:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:09,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 23:17:09,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 160 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-05 23:17:09,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:17:14,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:17:14,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440296523] [2024-11-05 23:17:14,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440296523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-05 23:17:14,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [179962509] [2024-11-05 23:17:14,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:17:14,475 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-05 23:17:14,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-05 23:17:14,477 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-05 23:17:14,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-05 23:17:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:17:14,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 23:17:14,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:17:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 160 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-05 23:17:15,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:17:15,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [179962509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-05 23:17:15,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 23:17:15,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-05 23:17:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090649578] [2024-11-05 23:17:15,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 23:17:15,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 23:17:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:17:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 23:17:15,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:17:15,276 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 23:17:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:17:15,767 INFO L93 Difference]: Finished difference Result 105 states and 137 transitions. [2024-11-05 23:17:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 23:17:15,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-11-05 23:17:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:17:15,769 INFO L225 Difference]: With dead ends: 105 [2024-11-05 23:17:15,770 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 23:17:15,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-05 23:17:15,771 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 12 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 23:17:15,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 139 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 23:17:15,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 23:17:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 23:17:15,772 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) [2024-11-05 23:17:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 23:17:15,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2024-11-05 23:17:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:17:15,772 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 23:17:15,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 23:17:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 23:17:15,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 23:17:15,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 23:17:15,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-05 23:17:15,981 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 [2024-11-05 23:17:16,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 [2024-11-05 23:17:16,179 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:17:16,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 23:17:17,999 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 23:17:18,007 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-05 23:17:18,015 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-05 23:17:18,015 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-05 23:17:18,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 11:17:18 BoogieIcfgContainer [2024-11-05 23:17:18,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 23:17:18,021 INFO L158 Benchmark]: Toolchain (without parser) took 16663.35ms. Allocated memory was 197.1MB in the beginning and 314.6MB in the end (delta: 117.4MB). Free memory was 152.7MB in the beginning and 162.8MB in the end (delta: -10.1MB). Peak memory consumption was 108.1MB. Max. memory is 8.0GB. [2024-11-05 23:17:18,021 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 23:17:18,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.57ms. Allocated memory is still 197.1MB. Free memory was 152.4MB in the beginning and 139.1MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-05 23:17:18,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.02ms. Allocated memory is still 197.1MB. Free memory was 138.8MB in the beginning and 137.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 23:17:18,022 INFO L158 Benchmark]: Boogie Preprocessor took 42.31ms. Allocated memory is still 197.1MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 23:17:18,022 INFO L158 Benchmark]: RCFGBuilder took 406.33ms. Allocated memory is still 197.1MB. Free memory was 134.9MB in the beginning and 123.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-11-05 23:17:18,022 INFO L158 Benchmark]: TraceAbstraction took 15928.91ms. Allocated memory was 197.1MB in the beginning and 314.6MB in the end (delta: 117.4MB). Free memory was 122.4MB in the beginning and 162.8MB in the end (delta: -40.5MB). Peak memory consumption was 77.7MB. Max. memory is 8.0GB. [2024-11-05 23:17:18,025 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.57ms. Allocated memory is still 197.1MB. Free memory was 152.4MB in the beginning and 139.1MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.02ms. Allocated memory is still 197.1MB. Free memory was 138.8MB in the beginning and 137.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.31ms. Allocated memory is still 197.1MB. Free memory was 137.4MB in the beginning and 135.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 406.33ms. Allocated memory is still 197.1MB. Free memory was 134.9MB in the beginning and 123.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15928.91ms. Allocated memory was 197.1MB in the beginning and 314.6MB in the end (delta: 117.4MB). Free memory was 122.4MB in the beginning and 162.8MB in the end (delta: -40.5MB). Peak memory consumption was 77.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 9, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 1290 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 922 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 368 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 695 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=4, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 93 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 671 NumberOfCodeBlocks, 671 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 661 ConstructedInterpolants, 92 QuantifiedInterpolants, 1613 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1088 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 1705/1709 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 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (last_1_var_1_7 == \old(last_1_var_1_7))) RESULT: Ultimate proved your program to be correct! [2024-11-05 23:17:18,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...