/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-1loop_file-93.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 01:04:57,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 01:04:57,164 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 01:04:57,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 01:04:57,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 01:04:57,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 01:04:57,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 01:04:57,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 01:04:57,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 01:04:57,203 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 01:04:57,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 01:04:57,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 01:04:57,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 01:04:57,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 01:04:57,206 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 01:04:57,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 01:04:57,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 01:04:57,207 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 01:04:57,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 01:04:57,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 01:04:57,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 01:04:57,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 01:04:57,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 01:04:57,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 01:04:57,209 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 01:04:57,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 01:04:57,210 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 01:04:57,210 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 01:04:57,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 01:04:57,210 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 01:04:57,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 01:04:57,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 01:04:57,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 01:04:57,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 01:04:57,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:04:57,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 01:04:57,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 01:04:57,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 01:04:57,212 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 01:04:57,213 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 01:04:57,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 01:04:57,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 01:04:57,213 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 01:04:57,213 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 01:04:57,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 01:04:57,214 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 01:04:57,214 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 01:04:57,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 01:04:57,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 01:04:57,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 01:04:57,476 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 01:04:57,476 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 01:04:57,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i [2023-12-24 01:04:58,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 01:04:58,974 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 01:04:58,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i [2023-12-24 01:04:58,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cc89fc8/75ca07509e9f4387a297c3b20b2df3e9/FLAG1021ca4ab [2023-12-24 01:04:58,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cc89fc8/75ca07509e9f4387a297c3b20b2df3e9 [2023-12-24 01:04:58,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 01:04:59,001 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 01:04:59,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 01:04:59,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 01:04:59,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 01:04:59,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:04:58" (1/1) ... [2023-12-24 01:04:59,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625fde94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59, skipping insertion in model container [2023-12-24 01:04:59,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:04:58" (1/1) ... [2023-12-24 01:04:59,040 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 01:04:59,189 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-1loop_file-93.i[915,928] [2023-12-24 01:04:59,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:04:59,247 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 01:04:59,256 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-1loop_file-93.i[915,928] [2023-12-24 01:04:59,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:04:59,289 INFO L206 MainTranslator]: Completed translation [2023-12-24 01:04:59,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59 WrapperNode [2023-12-24 01:04:59,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 01:04:59,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 01:04:59,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 01:04:59,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 01:04:59,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,342 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2023-12-24 01:04:59,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 01:04:59,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 01:04:59,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 01:04:59,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 01:04:59,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,366 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 01:04:59,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 01:04:59,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 01:04:59,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 01:04:59,397 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 01:04:59,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (1/1) ... [2023-12-24 01:04:59,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:04:59,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 01:04:59,431 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 01:04:59,442 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 01:04:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 01:04:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 01:04:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 01:04:59,458 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 01:04:59,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 01:04:59,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 01:04:59,522 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 01:04:59,523 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 01:05:10,965 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 01:05:11,027 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 01:05:11,027 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 01:05:11,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:05:11 BoogieIcfgContainer [2023-12-24 01:05:11,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 01:05:11,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 01:05:11,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 01:05:11,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 01:05:11,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:04:58" (1/3) ... [2023-12-24 01:05:11,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647ece39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:05:11, skipping insertion in model container [2023-12-24 01:05:11,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:04:59" (2/3) ... [2023-12-24 01:05:11,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647ece39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:05:11, skipping insertion in model container [2023-12-24 01:05:11,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:05:11" (3/3) ... [2023-12-24 01:05:11,037 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-93.i [2023-12-24 01:05:11,049 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 01:05:11,049 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 01:05:11,090 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 01:05:11,096 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;@140a0e2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 01:05:11,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 01:05:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 01:05:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-24 01:05:11,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:05:11,112 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:05:11,113 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:05:11,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:05:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1004756318, now seen corresponding path program 1 times [2023-12-24 01:05:11,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:05:11,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927542327] [2023-12-24 01:05:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:05:11,131 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 01:05:11,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:05:11,154 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 01:05:11,184 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 01:05:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:05:12,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 01:05:12,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:05:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2023-12-24 01:05:12,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:05:12,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:05:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927542327] [2023-12-24 01:05:12,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927542327] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:05:12,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:05:12,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 01:05:12,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137898854] [2023-12-24 01:05:12,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:05:12,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 01:05:12,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:05:12,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 01:05:12,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 01:05:12,757 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 01:05:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:05:13,624 INFO L93 Difference]: Finished difference Result 92 states and 161 transitions. [2023-12-24 01:05:13,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 01:05:13,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 108 [2023-12-24 01:05:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:05:13,633 INFO L225 Difference]: With dead ends: 92 [2023-12-24 01:05:13,633 INFO L226 Difference]: Without dead ends: 44 [2023-12-24 01:05:13,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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 01:05:13,639 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 01:05:13,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 01:05:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-24 01:05:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-24 01:05:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 01:05:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2023-12-24 01:05:13,676 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 108 [2023-12-24 01:05:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:05:13,676 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2023-12-24 01:05:13,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 01:05:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2023-12-24 01:05:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-24 01:05:13,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:05:13,679 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:05:13,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 01:05:13,879 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 01:05:13,880 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:05:13,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:05:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1882121826, now seen corresponding path program 1 times [2023-12-24 01:05:13,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:05:13,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496919876] [2023-12-24 01:05:13,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:05:13,882 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 01:05:13,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:05:13,883 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 01:05:13,886 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 01:05:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:05:15,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 01:05:15,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:06:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2023-12-24 01:06:09,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:06:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 01:06:23,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:06:23,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496919876] [2023-12-24 01:06:23,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496919876] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 01:06:23,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:06:23,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-12-24 01:06:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845529057] [2023-12-24 01:06:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:06:23,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 01:06:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:06:23,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 01:06:23,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-24 01:06:23,106 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 01:06:29,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 01:06:33,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 01:06:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:06:37,481 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2023-12-24 01:06:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 01:06:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 108 [2023-12-24 01:06:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:06:37,485 INFO L225 Difference]: With dead ends: 76 [2023-12-24 01:06:37,485 INFO L226 Difference]: Without dead ends: 74 [2023-12-24 01:06:37,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-24 01:06:37,487 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 54 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-12-24 01:06:37,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 242 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 55 Invalid, 2 Unknown, 0 Unchecked, 13.7s Time] [2023-12-24 01:06:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-24 01:06:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2023-12-24 01:06:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-24 01:06:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2023-12-24 01:06:37,502 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 108 [2023-12-24 01:06:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:06:37,502 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2023-12-24 01:06:37,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 01:06:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2023-12-24 01:06:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-24 01:06:37,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:06:37,505 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:06:37,552 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 01:06:37,731 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 01:06:37,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:06:37,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:06:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2030727135, now seen corresponding path program 1 times [2023-12-24 01:06:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:06:37,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625292201] [2023-12-24 01:06:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:06:37,733 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 01:06:37,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:06:37,735 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 01:06:37,743 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 01:06:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:06:39,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 01:06:39,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:06:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 288 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2023-12-24 01:06:51,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:06:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-24 01:06:53,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:06:53,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625292201] [2023-12-24 01:06:53,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625292201] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 01:06:53,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 01:06:53,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 01:06:53,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726704704] [2023-12-24 01:06:53,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 01:06:53,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 01:06:53,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:06:53,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 01:06:53,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-24 01:06:53,817 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2023-12-24 01:07:04,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 01:07:08,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 01:07:12,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 01:07:19,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 01:07:23,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 01:07:27,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 01:07:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:07:28,915 INFO L93 Difference]: Finished difference Result 109 states and 152 transitions. [2023-12-24 01:07:28,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 01:07:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 109 [2023-12-24 01:07:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:07:28,917 INFO L225 Difference]: With dead ends: 109 [2023-12-24 01:07:28,917 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 01:07:28,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2023-12-24 01:07:28,920 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 79 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 114 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2023-12-24 01:07:28,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 57 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 32.3s Time] [2023-12-24 01:07:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 01:07:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 01:07:28,921 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 01:07:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 01:07:28,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2023-12-24 01:07:28,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:07:28,921 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 01:07:28,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2023-12-24 01:07:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 01:07:28,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 01:07:28,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 01:07:28,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 01:07:29,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 01:07:29,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 01:07:47,011 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,012 INFO L895 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,012 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-12-24 01:07:47,012 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 01:07:47,012 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 01:07:47,012 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 01:07:47,012 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-24 01:07:47,012 INFO L899 garLoopResultBuilder]: For program point L94(lines 66 95) no Hoare annotation was computed. [2023-12-24 01:07:47,012 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,013 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,013 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,013 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,013 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-24 01:07:47,013 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 01:07:47,013 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,014 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-24 01:07:47,014 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-12-24 01:07:47,014 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,014 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,014 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,014 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,015 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,015 INFO L895 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,015 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 63) no Hoare annotation was computed. [2023-12-24 01:07:47,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 01:07:47,015 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-12-24 01:07:47,015 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-24 01:07:47,015 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2023-12-24 01:07:47,016 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 40 65) no Hoare annotation was computed. [2023-12-24 01:07:47,016 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 01:07:47,016 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-12-24 01:07:47,016 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-12-24 01:07:47,016 INFO L899 garLoopResultBuilder]: For program point L50(lines 40 65) no Hoare annotation was computed. [2023-12-24 01:07:47,016 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-12-24 01:07:47,016 INFO L895 garLoopResultBuilder]: At program point L108-3(lines 108 114) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,016 INFO L899 garLoopResultBuilder]: For program point L108-4(lines 108 114) no Hoare annotation was computed. [2023-12-24 01:07:47,016 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,017 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,017 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 53) no Hoare annotation was computed. [2023-12-24 01:07:47,017 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.geq ~var_1_1~0 .cse0) (fp.leq ~var_1_1~0 .cse1)) (and (fp.leq ~var_1_1~0 (fp.neg .cse0)) (fp.geq ~var_1_1~0 (fp.neg .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 01:07:47,017 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2023-12-24 01:07:47,017 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,017 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.neg .cse2))) (and (or (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)) (and (fp.leq ~var_1_7~0 .cse2) (fp.geq ~var_1_7~0 .cse3))) (or (and (fp.geq ~var_1_1~0 .cse3) (fp.leq ~var_1_1~0 .cse2)) (and (fp.leq ~var_1_1~0 .cse0) (fp.geq ~var_1_1~0 .cse1))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-24 01:07:47,017 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 01:07:47,018 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 01:07:47,018 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 01:07:47,018 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 01:07:47,021 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-24 01:07:47,022 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 01:07:47,033 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:07:47,033 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:07:47,034 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:07:47,034 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:07:47,034 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:07:47,034 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:07:47,034 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:07:47,034 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:07:47,035 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:07:47,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:07:47 BoogieIcfgContainer [2023-12-24 01:07:47,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 01:07:47,036 INFO L158 Benchmark]: Toolchain (without parser) took 168035.15ms. Allocated memory was 291.5MB in the beginning and 877.7MB in the end (delta: 586.2MB). Free memory was 241.8MB in the beginning and 490.0MB in the end (delta: -248.2MB). Peak memory consumption was 338.8MB. Max. memory is 8.0GB. [2023-12-24 01:07:47,036 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 210.8MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 01:07:47,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.84ms. Allocated memory is still 291.5MB. Free memory was 241.5MB in the beginning and 228.2MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 01:07:47,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.66ms. Allocated memory is still 291.5MB. Free memory was 228.2MB in the beginning and 226.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 01:07:47,037 INFO L158 Benchmark]: Boogie Preprocessor took 52.07ms. Allocated memory is still 291.5MB. Free memory was 226.1MB in the beginning and 223.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 01:07:47,037 INFO L158 Benchmark]: RCFGBuilder took 11633.66ms. Allocated memory is still 291.5MB. Free memory was 223.4MB in the beginning and 204.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 01:07:47,038 INFO L158 Benchmark]: TraceAbstraction took 156003.55ms. Allocated memory was 291.5MB in the beginning and 877.7MB in the end (delta: 586.2MB). Free memory was 203.8MB in the beginning and 490.0MB in the end (delta: -286.2MB). Peak memory consumption was 301.0MB. Max. memory is 8.0GB. [2023-12-24 01:07:47,039 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.58ms. Allocated memory is still 210.8MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.84ms. Allocated memory is still 291.5MB. Free memory was 241.5MB in the beginning and 228.2MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.66ms. Allocated memory is still 291.5MB. Free memory was 228.2MB in the beginning and 226.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.07ms. Allocated memory is still 291.5MB. Free memory was 226.1MB in the beginning and 223.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 11633.66ms. Allocated memory is still 291.5MB. Free memory was 223.4MB in the beginning and 204.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 156003.55ms. Allocated memory was 291.5MB in the beginning and 877.7MB in the end (delta: 586.2MB). Free memory was 203.8MB in the beginning and 490.0MB in the end (delta: -286.2MB). Peak memory consumption was 301.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - 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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 155.9s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 50.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 46.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 361 SdHoareTripleChecker+Invalid, 44.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 197 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 164 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 78 PreInvPairs, 103 NumberOfFragments, 1002 HoareAnnotationTreeSize, 78 FormulaSimplifications, 341 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FormulaSimplificationsInter, 850 FormulaSimplificationTreeSizeReductionInter, 17.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 82.7s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 537 ConstructedInterpolants, 0 QuantifiedInterpolants, 4167 SizeOfPredicates, 24 NumberOfNonLiveVariables, 550 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2700/3060 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: 108]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 01:07:47,248 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 01:07:47,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...