/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-93.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 02:29:16,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 02:29:16,398 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:29:16,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 02:29:16,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 02:29:16,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 02:29:16,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 02:29:16,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 02:29:16,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 02:29:16,428 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 02:29:16,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 02:29:16,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 02:29:16,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 02:29:16,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 02:29:16,430 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 02:29:16,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 02:29:16,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 02:29:16,431 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 02:29:16,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 02:29:16,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 02:29:16,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 02:29:16,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 02:29:16,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 02:29:16,433 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 02:29:16,433 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 02:29:16,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 02:29:16,433 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 02:29:16,433 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 02:29:16,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 02:29:16,433 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 02:29:16,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 02:29:16,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 02:29:16,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 02:29:16,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 02:29:16,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:29:16,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 02:29:16,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 02:29:16,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 02:29:16,435 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 02:29:16,435 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 02:29:16,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 02:29:16,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 02:29:16,436 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 02:29:16,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 02:29:16,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 02:29:16,436 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 02:29:16,436 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:29:16,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 02:29:16,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 02:29:16,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 02:29:16,660 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 02:29:16,660 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 02:29:16,661 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-93.i [2023-12-24 02:29:17,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 02:29:17,765 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 02:29:17,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-93.i [2023-12-24 02:29:17,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6708b49d/883e673159904e45b0fc38cd88ed8dba/FLAG4eea1dbf2 [2023-12-24 02:29:17,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6708b49d/883e673159904e45b0fc38cd88ed8dba [2023-12-24 02:29:17,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 02:29:17,783 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 02:29:17,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 02:29:17,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 02:29:17,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 02:29:17,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:17,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68af7800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17, skipping insertion in model container [2023-12-24 02:29:17,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:17,804 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 02:29:17,893 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-93.i[915,928] [2023-12-24 02:29:17,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:29:17,928 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 02:29:17,937 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-93.i[915,928] [2023-12-24 02:29:17,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:29:17,962 INFO L206 MainTranslator]: Completed translation [2023-12-24 02:29:17,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17 WrapperNode [2023-12-24 02:29:17,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 02:29:17,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 02:29:17,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 02:29:17,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 02:29:17,968 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:29:17" (1/1) ... [2023-12-24 02:29:17,976 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:29:17" (1/1) ... [2023-12-24 02:29:17,993 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2023-12-24 02:29:17,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 02:29:17,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 02:29:17,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 02:29:17,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 02:29:18,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:18,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:18,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:18,015 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:29:18,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:18,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:18,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:18,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:18,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:18,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:18,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 02:29:18,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 02:29:18,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 02:29:18,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 02:29:18,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (1/1) ... [2023-12-24 02:29:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:29:18,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 02:29:18,059 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:29:18,100 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:29:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 02:29:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 02:29:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 02:29:18,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 02:29:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 02:29:18,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 02:29:18,192 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 02:29:18,194 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 02:29:29,086 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 02:29:29,146 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 02:29:29,147 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 02:29:29,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:29:29 BoogieIcfgContainer [2023-12-24 02:29:29,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 02:29:29,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 02:29:29,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 02:29:29,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 02:29:29,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 02:29:17" (1/3) ... [2023-12-24 02:29:29,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6797ff05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:29:29, skipping insertion in model container [2023-12-24 02:29:29,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:29:17" (2/3) ... [2023-12-24 02:29:29,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6797ff05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:29:29, skipping insertion in model container [2023-12-24 02:29:29,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:29:29" (3/3) ... [2023-12-24 02:29:29,159 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-93.i [2023-12-24 02:29:29,170 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 02:29:29,171 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 02:29:29,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 02:29:29,215 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;@65f9b53d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 02:29:29,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 02:29:29,219 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 02:29:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-24 02:29:29,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:29:29,232 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 02:29:29,233 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:29:29,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:29:29,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1964301663, now seen corresponding path program 1 times [2023-12-24 02:29:29,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:29:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481412236] [2023-12-24 02:29:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:29:29,248 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:29:29,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:29:29,251 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:29:29,252 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:29:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:29:30,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 02:29:30,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:29:30,639 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 02:29:30,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:29:30,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:29:30,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481412236] [2023-12-24 02:29:30,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481412236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:29:30,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:29:30,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 02:29:30,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367775161] [2023-12-24 02:29:30,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:29:30,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 02:29:30,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:29:30,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 02:29:30,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 02:29:30,663 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 02:29:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:29:31,242 INFO L93 Difference]: Finished difference Result 90 states and 160 transitions. [2023-12-24 02:29:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 02:29:31,259 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 02:29:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:29:31,264 INFO L225 Difference]: With dead ends: 90 [2023-12-24 02:29:31,264 INFO L226 Difference]: Without dead ends: 44 [2023-12-24 02:29:31,266 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 02:29:31,268 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 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.6s IncrementalHoareTripleChecker+Time [2023-12-24 02:29:31,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 02:29:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-24 02:29:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-24 02:29:31,294 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 02:29:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2023-12-24 02:29:31,296 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 108 [2023-12-24 02:29:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:29:31,297 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2023-12-24 02:29:31,297 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 02:29:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2023-12-24 02:29:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-24 02:29:31,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:29:31,300 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 02:29:31,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 02:29:31,516 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:29:31,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:29:31,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:29:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash 922576481, now seen corresponding path program 1 times [2023-12-24 02:29:31,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:29:31,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190890025] [2023-12-24 02:29:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:29:31,518 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:29:31,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:29:31,520 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:29:31,521 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:29:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:29:32,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 02:29:32,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:30:22,235 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 02:30:22,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:31:37,345 WARN L293 SmtUtils]: Spent 9.25s on a formula simplification. DAG size of input: 56 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:31:55,116 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 02:31:55,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:31:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190890025] [2023-12-24 02:31:55,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190890025] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 02:31:55,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 02:31:55,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2023-12-24 02:31:55,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147442360] [2023-12-24 02:31:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:31:55,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 02:31:55,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:31:55,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 02:31:55,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-24 02:31:55,120 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 02:32:01,340 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 02:32:05,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:32:08,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:32:23,764 WARN L293 SmtUtils]: Spent 10.56s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:32:24,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:32:26,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:32:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:32:36,962 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2023-12-24 02:32:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 02:32:36,963 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 02:32:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:32:36,964 INFO L225 Difference]: With dead ends: 76 [2023-12-24 02:32:36,964 INFO L226 Difference]: Without dead ends: 74 [2023-12-24 02:32:36,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-24 02:32:36,965 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 54 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2023-12-24 02:32:36,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 229 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 2 Unknown, 0 Unchecked, 26.9s Time] [2023-12-24 02:32:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-24 02:32:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2023-12-24 02:32:36,979 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 02:32:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2023-12-24 02:32:36,980 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 108 [2023-12-24 02:32:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:32:36,981 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2023-12-24 02:32:36,981 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 02:32:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2023-12-24 02:32:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-24 02:32:36,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:32:36,982 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 02:32:37,006 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 (3)] Ended with exit code 0 [2023-12-24 02:32:37,196 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:32:37,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:32:37,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:32:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1709899395, now seen corresponding path program 1 times [2023-12-24 02:32:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:32:37,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961106269] [2023-12-24 02:32:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:32:37,198 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:32:37,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:32:37,199 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:32:37,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 02:32:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:32:38,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 02:32:38,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:32:50,462 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 02:32:50,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:32:52,809 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 02:32:52,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:32:52,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961106269] [2023-12-24 02:32:52,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961106269] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 02:32:52,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 02:32:52,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 02:32:52,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789502034] [2023-12-24 02:32:52,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 02:32:52,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 02:32:52,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:32:52,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 02:32:52,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-24 02:32:52,812 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 02:33:03,331 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 02:33:07,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:33:11,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:33:17,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:33:21,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:33:25,872 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 02:33:28,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:33:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:33:28,093 INFO L93 Difference]: Finished difference Result 109 states and 152 transitions. [2023-12-24 02:33:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 02:33:28,112 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 02:33:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:33:28,113 INFO L225 Difference]: With dead ends: 109 [2023-12-24 02:33:28,113 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 02:33:28,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2023-12-24 02:33:28,115 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 127 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2023-12-24 02:33:28,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 58 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 32.5s Time] [2023-12-24 02:33:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 02:33:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 02:33:28,116 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:33:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 02:33:28,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2023-12-24 02:33:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:33:28,116 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 02:33:28,116 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 02:33:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 02:33:28,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 02:33:28,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 02:33:28,148 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:33:28,336 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 02:33:28,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 02:33:45,131 WARN L293 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 112 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 02:33:49,986 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 02:33:49,986 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 02:33:49,986 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-12-24 02:33:49,986 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 02:33:49,986 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 02:33:49,986 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 02:33:49,986 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 02:33:49,986 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 02:33:49,986 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 02:33:49,987 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 02:33:49,987 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-24 02:33:49,987 INFO L899 garLoopResultBuilder]: For program point L94(lines 66 95) no Hoare annotation was computed. [2023-12-24 02:33:49,987 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 02:33:49,987 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 02:33:49,987 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 63) no Hoare annotation was computed. [2023-12-24 02:33:49,987 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 02:33:49,987 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-12-24 02:33:49,987 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 02:33:49,987 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 02:33:49,988 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-24 02:33:49,988 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2023-12-24 02:33:49,988 INFO L895 garLoopResultBuilder]: At program point L107-2(lines 107 113) 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 02:33:49,988 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 40 65) no Hoare annotation was computed. [2023-12-24 02:33:49,988 INFO L899 garLoopResultBuilder]: For program point L107-3(lines 107 113) no Hoare annotation was computed. [2023-12-24 02:33:49,988 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 02:33:49,988 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-12-24 02:33:49,988 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-12-24 02:33:49,988 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 02:33:49,988 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 02:33:49,988 INFO L899 garLoopResultBuilder]: For program point L50(lines 40 65) no Hoare annotation was computed. [2023-12-24 02:33:49,988 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-24 02:33:49,989 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-12-24 02:33:49,989 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 02:33:49,989 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 02:33:49,989 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-24 02:33:49,989 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-12-24 02:33:49,989 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 02:33:49,989 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 02:33:49,989 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 53) no Hoare annotation was computed. [2023-12-24 02:33:49,989 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 02:33:49,989 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2023-12-24 02:33:49,990 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 02:33:49,990 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 02:33:49,990 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 02:33:49,990 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 02:33:49,990 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 02:33:49,990 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 02:33:49,992 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-24 02:33:49,994 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 02:33:50,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:33:50,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:33:50,003 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:33:50,004 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:33:50,004 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:33:50,004 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:33:50,005 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:33:50,005 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:33:50,005 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 02:33:50,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:33:50 BoogieIcfgContainer [2023-12-24 02:33:50,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 02:33:50,006 INFO L158 Benchmark]: Toolchain (without parser) took 272222.87ms. Allocated memory was 182.5MB in the beginning and 795.9MB in the end (delta: 613.4MB). Free memory was 138.1MB in the beginning and 294.5MB in the end (delta: -156.4MB). Peak memory consumption was 457.7MB. Max. memory is 8.0GB. [2023-12-24 02:33:50,006 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 182.5MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 02:33:50,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.74ms. Allocated memory is still 182.5MB. Free memory was 137.8MB in the beginning and 124.5MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 02:33:50,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.05ms. Allocated memory is still 182.5MB. Free memory was 124.5MB in the beginning and 122.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 02:33:50,009 INFO L158 Benchmark]: Boogie Preprocessor took 35.12ms. Allocated memory is still 182.5MB. Free memory was 122.4MB in the beginning and 119.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 02:33:50,009 INFO L158 Benchmark]: RCFGBuilder took 11117.86ms. Allocated memory is still 182.5MB. Free memory was 119.9MB in the beginning and 100.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 02:33:50,009 INFO L158 Benchmark]: TraceAbstraction took 260857.01ms. Allocated memory was 182.5MB in the beginning and 795.9MB in the end (delta: 613.4MB). Free memory was 99.3MB in the beginning and 294.5MB in the end (delta: -195.2MB). Peak memory consumption was 418.9MB. Max. memory is 8.0GB. [2023-12-24 02:33:50,011 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.43ms. Allocated memory is still 182.5MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.74ms. Allocated memory is still 182.5MB. Free memory was 137.8MB in the beginning and 124.5MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.05ms. Allocated memory is still 182.5MB. Free memory was 124.5MB in the beginning and 122.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.12ms. Allocated memory is still 182.5MB. Free memory was 122.4MB in the beginning and 119.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 11117.86ms. Allocated memory is still 182.5MB. Free memory was 119.9MB in the beginning and 100.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 260857.01ms. Allocated memory was 182.5MB in the beginning and 795.9MB in the end (delta: 613.4MB). Free memory was 99.3MB in the beginning and 294.5MB in the end (delta: -195.2MB). Peak memory consumption was 418.9MB. 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: 260.8s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 77.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 21.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 60.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 349 SdHoareTripleChecker+Invalid, 57.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 187 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 161 mSDtfsCounter, 187 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, 50.0s 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, 3399 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FormulaSimplificationsInter, 1145 FormulaSimplificationTreeSizeReductionInter, 21.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 156.6s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 537 ConstructedInterpolants, 1 QuantifiedInterpolants, 4450 SizeOfPredicates, 26 NumberOfNonLiveVariables, 543 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: 107]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 02:33:50,227 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 02:33:50,325 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...