/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 02:25:36,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 02:25:36,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 02:25:36,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 02:25:36,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 02:25:36,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 02:25:36,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 02:25:36,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 02:25:36,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 02:25:36,605 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 02:25:36,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 02:25:36,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 02:25:36,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 02:25:36,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 02:25:36,607 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 02:25:36,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 02:25:36,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 02:25:36,608 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 02:25:36,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 02:25:36,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 02:25:36,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 02:25:36,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 02:25:36,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 02:25:36,610 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 02:25:36,610 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 02:25:36,610 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 02:25:36,610 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 02:25:36,610 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 02:25:36,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 02:25:36,611 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 02:25:36,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 02:25:36,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 02:25:36,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 02:25:36,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 02:25:36,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:25:36,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 02:25:36,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 02:25:36,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 02:25:36,613 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 02:25:36,613 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 02:25:36,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 02:25:36,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 02:25:36,614 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 02:25:36,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 02:25:36,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 02:25:36,615 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 02:25:36,615 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 02:25:36,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 02:25:36,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 02:25:36,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 02:25:36,869 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 02:25:36,871 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 02:25:36,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i [2023-12-24 02:25:37,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 02:25:38,098 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 02:25:38,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i [2023-12-24 02:25:38,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1c3b0d1/8ee2442bd2844eb7b4ebf818d1d6f8e4/FLAGb3a72a1fd [2023-12-24 02:25:38,120 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1c3b0d1/8ee2442bd2844eb7b4ebf818d1d6f8e4 [2023-12-24 02:25:38,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 02:25:38,124 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 02:25:38,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 02:25:38,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 02:25:38,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 02:25:38,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278b6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38, skipping insertion in model container [2023-12-24 02:25:38,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,154 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 02:25:38,266 WARN L239 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_loopvsstraightlinecode_25-while_file-88.i[915,928] [2023-12-24 02:25:38,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:25:38,301 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 02:25:38,308 WARN L239 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_loopvsstraightlinecode_25-while_file-88.i[915,928] [2023-12-24 02:25:38,320 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:25:38,330 INFO L206 MainTranslator]: Completed translation [2023-12-24 02:25:38,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38 WrapperNode [2023-12-24 02:25:38,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 02:25:38,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 02:25:38,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 02:25:38,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 02:25:38,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,354 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2023-12-24 02:25:38,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 02:25:38,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 02:25:38,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 02:25:38,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 02:25:38,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,365 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,372 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 02:25:38,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 02:25:38,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 02:25:38,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 02:25:38,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 02:25:38,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (1/1) ... [2023-12-24 02:25:38,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:25:38,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 02:25:38,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 02:25:38,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 02:25:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 02:25:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 02:25:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 02:25:38,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 02:25:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 02:25:38,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 02:25:38,521 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 02:25:38,522 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 02:25:38,741 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 02:25:38,780 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 02:25:38,780 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 02:25:38,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:25:38 BoogieIcfgContainer [2023-12-24 02:25:38,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 02:25:38,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 02:25:38,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 02:25:38,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 02:25:38,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 02:25:38" (1/3) ... [2023-12-24 02:25:38,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c99893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:25:38, skipping insertion in model container [2023-12-24 02:25:38,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:25:38" (2/3) ... [2023-12-24 02:25:38,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c99893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:25:38, skipping insertion in model container [2023-12-24 02:25:38,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:25:38" (3/3) ... [2023-12-24 02:25:38,793 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-88.i [2023-12-24 02:25:38,831 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 02:25:38,831 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 02:25:38,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 02:25:38,895 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@b751988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 02:25:38,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 02:25:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 02:25:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-24 02:25:38,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:25:38,904 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:25:38,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:25:38,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:25:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1794176218, now seen corresponding path program 1 times [2023-12-24 02:25:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:25:38,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648626404] [2023-12-24 02:25:38,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:25:38,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:25:38,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:25:38,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:25:38,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 02:25:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:25:39,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 02:25:39,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:25:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-24 02:25:39,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:25:39,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:25:39,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648626404] [2023-12-24 02:25:39,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648626404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:25:39,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:25:39,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 02:25:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798033417] [2023-12-24 02:25:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:25:39,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 02:25:39,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:25:39,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 02:25:39,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 02:25:39,100 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 02:25:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:25:39,159 INFO L93 Difference]: Finished difference Result 67 states and 113 transitions. [2023-12-24 02:25:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 02:25:39,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 69 [2023-12-24 02:25:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:25:39,170 INFO L225 Difference]: With dead ends: 67 [2023-12-24 02:25:39,170 INFO L226 Difference]: Without dead ends: 33 [2023-12-24 02:25:39,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 02:25:39,175 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 02:25:39,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 02:25:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-24 02:25:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-24 02:25:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 02:25:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2023-12-24 02:25:39,204 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 69 [2023-12-24 02:25:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:25:39,204 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2023-12-24 02:25:39,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 02:25:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2023-12-24 02:25:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-24 02:25:39,207 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:25:39,207 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:25:39,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 02:25:39,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:25:39,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:25:39,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:25:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash 191366812, now seen corresponding path program 1 times [2023-12-24 02:25:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:25:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283750208] [2023-12-24 02:25:39,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:25:39,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:25:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:25:39,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:25:39,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 02:25:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:25:39,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 02:25:39,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:25:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-24 02:25:41,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:25:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 02:25:45,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:25:45,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283750208] [2023-12-24 02:25:45,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283750208] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 02:25:45,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 02:25:45,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2023-12-24 02:25:45,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761942046] [2023-12-24 02:25:45,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:25:45,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 02:25:45,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:25:45,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 02:25:45,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-12-24 02:25:45,679 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 02:25:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:25:47,887 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2023-12-24 02:25:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 02:25:47,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 69 [2023-12-24 02:25:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:25:47,891 INFO L225 Difference]: With dead ends: 82 [2023-12-24 02:25:47,891 INFO L226 Difference]: Without dead ends: 50 [2023-12-24 02:25:47,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-12-24 02:25:47,892 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-24 02:25:47,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 123 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-24 02:25:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-24 02:25:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-12-24 02:25:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 02:25:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2023-12-24 02:25:47,911 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 69 [2023-12-24 02:25:47,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:25:47,912 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2023-12-24 02:25:47,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 02:25:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2023-12-24 02:25:47,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-24 02:25:47,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:25:47,913 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:25:47,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 02:25:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:25:48,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:25:48,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:25:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 248625114, now seen corresponding path program 1 times [2023-12-24 02:25:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:25:48,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219226694] [2023-12-24 02:25:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:25:48,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:25:48,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:25:48,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:25:48,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 02:25:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:25:48,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 02:25:48,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:25:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 149 proven. 24 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-24 02:25:49,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:25:54,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:25:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219226694] [2023-12-24 02:25:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219226694] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 02:25:54,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1493785468] [2023-12-24 02:25:54,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:25:54,819 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 02:25:54,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 02:25:54,858 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 02:25:54,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-24 02:25:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:25:55,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 02:25:55,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:26:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 158 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-24 02:26:01,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:26:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-24 02:26:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1493785468] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 02:26:08,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-24 02:26:08,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 10] total 40 [2023-12-24 02:26:08,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832094534] [2023-12-24 02:26:08,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-24 02:26:08,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-24 02:26:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:26:08,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-24 02:26:08,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1654, Unknown=0, NotChecked=0, Total=1980 [2023-12-24 02:26:08,715 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2023-12-24 02:26:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:26:20,870 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2023-12-24 02:26:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-12-24 02:26:20,871 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 69 [2023-12-24 02:26:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:26:20,872 INFO L225 Difference]: With dead ends: 170 [2023-12-24 02:26:20,872 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 02:26:20,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2842 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=1985, Invalid=7915, Unknown=0, NotChecked=0, Total=9900 [2023-12-24 02:26:20,876 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 125 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-24 02:26:20,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 329 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-24 02:26:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 02:26:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 02:26:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 02:26:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 02:26:20,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2023-12-24 02:26:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:26:20,878 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 02:26:20,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2023-12-24 02:26:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 02:26:20,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 02:26:20,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 02:26:20,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 02:26:21,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-12-24 02:26:21,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 02:26:21,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 02:26:27,216 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-24 02:26:27,216 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 02:26:27,217 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 02:26:27,217 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 02:26:27,217 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 02:26:27,217 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 02:26:27,217 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 56) no Hoare annotation was computed. [2023-12-24 02:26:27,217 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-12-24 02:26:27,217 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2023-12-24 02:26:27,217 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_14~0))) (and (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)) (fp.eq ~var_1_18~0 ~var_1_18~0) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 02:26:27,217 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_14~0))) (and (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)) (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsge ((_ zero_extend 24) ~var_1_15~0) (_ bv1 32)) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 02:26:27,217 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 57) no Hoare annotation was computed. [2023-12-24 02:26:27,217 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-12-24 02:26:27,218 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 02:26:27,218 INFO L895 garLoopResultBuilder]: At program point L86-2(lines 86 92) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 02:26:27,218 INFO L899 garLoopResultBuilder]: For program point L86-3(lines 86 92) no Hoare annotation was computed. [2023-12-24 02:26:27,218 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 53) no Hoare annotation was computed. [2023-12-24 02:26:27,218 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_14~0)) (.cse3 ((_ zero_extend 24) ~var_1_15~0))) (and (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)) (let ((.cse2 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse1)) (fp.geq ~var_1_18~0 (fp.neg .cse2))) (and (fp.leq ~var_1_18~0 .cse2) (fp.geq ~var_1_18~0 .cse1)))) (bvsle .cse3 (_ bv1 32)) (bvsge .cse3 (_ bv1 32)) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 02:26:27,218 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_14~0)) (.cse3 ((_ zero_extend 24) ~var_1_15~0))) (and (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)) (let ((.cse2 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse1)) (fp.geq ~var_1_18~0 (fp.neg .cse2))) (and (fp.leq ~var_1_18~0 .cse2) (fp.geq ~var_1_18~0 .cse1)))) (bvsle .cse3 (_ bv1 32)) (bvsge .cse3 (_ bv1 32)) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 02:26:27,218 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-24 02:26:27,218 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (fp.eq ~var_1_18~0 ~var_1_18~0) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 02:26:27,218 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_14~0) (_ bv1 32)) (fp.eq ~var_1_18~0 ~var_1_18~0) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 02:26:27,218 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 02:26:27,218 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-12-24 02:26:27,218 INFO L899 garLoopResultBuilder]: For program point L75(lines 58 76) no Hoare annotation was computed. [2023-12-24 02:26:27,219 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 02:26:27,219 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-24 02:26:27,219 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (fp.eq ~var_1_18~0 ~var_1_18~0) (= ~var_1_11~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 02:26:27,219 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (fp.eq ~var_1_18~0 ~var_1_18~0) (= ~var_1_11~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 02:26:27,219 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_14~0)) (.cse1 ((_ zero_extend 24) ~var_1_15~0))) (and (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 02:26:27,219 INFO L899 garLoopResultBuilder]: For program point L72-1(line 72) no Hoare annotation was computed. [2023-12-24 02:26:27,219 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 02:26:27,219 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 02:26:27,219 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 02:26:27,219 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 02:26:27,221 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-24 02:26:27,223 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 02:26:27,231 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-12-24 02:26:27,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-12-24 02:26:27,232 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:26:27,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:26:27 BoogieIcfgContainer [2023-12-24 02:26:27,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 02:26:27,233 INFO L158 Benchmark]: Toolchain (without parser) took 49109.30ms. Allocated memory was 255.9MB in the beginning and 369.1MB in the end (delta: 113.2MB). Free memory was 204.5MB in the beginning and 286.6MB in the end (delta: -82.1MB). Peak memory consumption was 201.3MB. Max. memory is 8.0GB. [2023-12-24 02:26:27,233 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 02:26:27,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.67ms. Allocated memory is still 255.9MB. Free memory was 204.3MB in the beginning and 191.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 02:26:27,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.11ms. Allocated memory is still 255.9MB. Free memory was 191.7MB in the beginning and 189.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 02:26:27,234 INFO L158 Benchmark]: Boogie Preprocessor took 28.87ms. Allocated memory is still 255.9MB. Free memory was 189.6MB in the beginning and 187.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 02:26:27,234 INFO L158 Benchmark]: RCFGBuilder took 396.26ms. Allocated memory is still 255.9MB. Free memory was 187.3MB in the beginning and 170.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 02:26:27,234 INFO L158 Benchmark]: TraceAbstraction took 48449.92ms. Allocated memory was 255.9MB in the beginning and 369.1MB in the end (delta: 113.2MB). Free memory was 169.7MB in the beginning and 286.6MB in the end (delta: -116.9MB). Peak memory consumption was 166.7MB. Max. memory is 8.0GB. [2023-12-24 02:26:27,235 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.13ms. Allocated memory is still 210.8MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.67ms. Allocated memory is still 255.9MB. Free memory was 204.3MB in the beginning and 191.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.11ms. Allocated memory is still 255.9MB. Free memory was 191.7MB in the beginning and 189.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.87ms. Allocated memory is still 255.9MB. Free memory was 189.6MB in the beginning and 187.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 396.26ms. Allocated memory is still 255.9MB. Free memory was 187.3MB in the beginning and 170.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 48449.92ms. Allocated memory was 255.9MB in the beginning and 369.1MB in the end (delta: 113.2MB). Free memory was 169.7MB in the beginning and 286.6MB in the end (delta: -116.9MB). Peak memory consumption was 166.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.3s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 495 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1160 IncrementalHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 136 mSDtfsCounter, 1160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2885 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=2, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 70 PreInvPairs, 96 NumberOfFragments, 585 HoareAnnotationTreeSize, 70 FormulaSimplifications, 622 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FormulaSimplificationsInter, 3439 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 26.5s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 3505 SizeOfPredicates, 64 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1254/1320 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: 86]: Loop Invariant Derived loop invariant: ((var_1_11 == 0) && (var_1_12 <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-24 02:26:27,320 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...