/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-88.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 01:02:16,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 01:02:16,686 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:02:16,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 01:02:16,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 01:02:16,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 01:02:16,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 01:02:16,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 01:02:16,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 01:02:16,718 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 01:02:16,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 01:02:16,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 01:02:16,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 01:02:16,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 01:02:16,720 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 01:02:16,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 01:02:16,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 01:02:16,721 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 01:02:16,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 01:02:16,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 01:02:16,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 01:02:16,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 01:02:16,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 01:02:16,722 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 01:02:16,722 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 01:02:16,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 01:02:16,723 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 01:02:16,723 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 01:02:16,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 01:02:16,723 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 01:02:16,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 01:02:16,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 01:02:16,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 01:02:16,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 01:02:16,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:02:16,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 01:02:16,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 01:02:16,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 01:02:16,725 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 01:02:16,725 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 01:02:16,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 01:02:16,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 01:02:16,725 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 01:02:16,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 01:02:16,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 01:02:16,726 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 01:02:16,726 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:02:16,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 01:02:16,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 01:02:16,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 01:02:16,957 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 01:02:16,957 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 01:02:16,959 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-88.i [2023-12-24 01:02:18,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 01:02:18,252 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 01:02:18,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i [2023-12-24 01:02:18,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6783d32ec/4edf818494ee4dc19855f4f442fa652d/FLAG1759b5836 [2023-12-24 01:02:18,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6783d32ec/4edf818494ee4dc19855f4f442fa652d [2023-12-24 01:02:18,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 01:02:18,279 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 01:02:18,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 01:02:18,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 01:02:18,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 01:02:18,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1933e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18, skipping insertion in model container [2023-12-24 01:02:18,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,312 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 01:02:18,448 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-88.i[915,928] [2023-12-24 01:02:18,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:02:18,510 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 01:02:18,519 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-88.i[915,928] [2023-12-24 01:02:18,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:02:18,541 INFO L206 MainTranslator]: Completed translation [2023-12-24 01:02:18,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18 WrapperNode [2023-12-24 01:02:18,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 01:02:18,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 01:02:18,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 01:02:18,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 01:02:18,547 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:02:18" (1/1) ... [2023-12-24 01:02:18,554 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:02:18" (1/1) ... [2023-12-24 01:02:18,573 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2023-12-24 01:02:18,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 01:02:18,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 01:02:18,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 01:02:18,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 01:02:18,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,608 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:02:18,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 01:02:18,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 01:02:18,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 01:02:18,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 01:02:18,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (1/1) ... [2023-12-24 01:02:18,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:02:18,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 01:02:18,660 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:02:18,665 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:02:18,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 01:02:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 01:02:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 01:02:18,685 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 01:02:18,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 01:02:18,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 01:02:18,735 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 01:02:18,737 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 01:02:19,046 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 01:02:19,098 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 01:02:19,099 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 01:02:19,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:02:19 BoogieIcfgContainer [2023-12-24 01:02:19,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 01:02:19,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 01:02:19,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 01:02:19,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 01:02:19,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:02:18" (1/3) ... [2023-12-24 01:02:19,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc4ce95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:02:19, skipping insertion in model container [2023-12-24 01:02:19,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:02:18" (2/3) ... [2023-12-24 01:02:19,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc4ce95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:02:19, skipping insertion in model container [2023-12-24 01:02:19,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:02:19" (3/3) ... [2023-12-24 01:02:19,109 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-88.i [2023-12-24 01:02:19,123 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 01:02:19,123 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 01:02:19,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 01:02:19,173 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;@2b466437, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 01:02:19,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 01:02:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 01:02:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-24 01:02:19,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:02:19,185 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:02:19,185 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:02:19,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:02:19,191 INFO L85 PathProgramCache]: Analyzing trace with hash 387465630, now seen corresponding path program 1 times [2023-12-24 01:02:19,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:02:19,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702074000] [2023-12-24 01:02:19,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:02:19,204 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:02:19,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:02:19,207 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:02:19,212 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:02:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:02:19,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 01:02:19,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:02:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-24 01:02:19,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:02:19,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:02:19,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702074000] [2023-12-24 01:02:19,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702074000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:02:19,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:02:19,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 01:02:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358063795] [2023-12-24 01:02:19,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:02:19,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 01:02:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:02:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 01:02:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 01:02:19,432 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 01:02:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:02:19,549 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2023-12-24 01:02:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 01:02:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 69 [2023-12-24 01:02:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:02:19,556 INFO L225 Difference]: With dead ends: 69 [2023-12-24 01:02:19,557 INFO L226 Difference]: Without dead ends: 33 [2023-12-24 01:02:19,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 01:02:19,561 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 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.1s IncrementalHoareTripleChecker+Time [2023-12-24 01:02:19,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 01:02:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-24 01:02:19,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-24 01:02:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-24 01:02:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2023-12-24 01:02:19,588 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 69 [2023-12-24 01:02:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:02:19,588 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2023-12-24 01:02:19,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 01:02:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2023-12-24 01:02:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-24 01:02:19,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:02:19,591 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:02:19,596 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:02:19,796 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:02:19,797 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:02:19,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:02:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1215343776, now seen corresponding path program 1 times [2023-12-24 01:02:19,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:02:19,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697244973] [2023-12-24 01:02:19,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:02:19,799 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:02:19,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:02:19,800 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:02:19,803 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:02:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:02:19,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 01:02:19,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:02:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-24 01:02:22,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:02:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-24 01:02:26,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:02:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697244973] [2023-12-24 01:02:26,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697244973] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 01:02:26,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:02:26,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2023-12-24 01:02:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280972290] [2023-12-24 01:02:26,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:02:26,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 01:02:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:02:26,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 01:02:26,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-12-24 01:02:26,888 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 01:02:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:02:28,998 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2023-12-24 01:02:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 01:02:29,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 69 [2023-12-24 01:02:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:02:29,001 INFO L225 Difference]: With dead ends: 82 [2023-12-24 01:02:29,002 INFO L226 Difference]: Without dead ends: 50 [2023-12-24 01:02:29,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2023-12-24 01:02:29,003 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 44 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-24 01:02:29,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 107 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-24 01:02:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-24 01:02:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-12-24 01:02:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-24 01:02:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2023-12-24 01:02:29,012 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 69 [2023-12-24 01:02:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:02:29,013 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2023-12-24 01:02:29,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-24 01:02:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2023-12-24 01:02:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-24 01:02:29,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:02:29,014 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 01:02:29,021 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:02:29,221 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:02:29,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:02:29,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:02:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1158085474, now seen corresponding path program 1 times [2023-12-24 01:02:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:02:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430881018] [2023-12-24 01:02:29,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:02:29,223 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:02:29,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:02:29,228 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:02:29,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 01:02:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:02:29,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 01:02:29,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:02:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 149 proven. 24 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-24 01:02:31,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:02:36,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:02:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430881018] [2023-12-24 01:02:36,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430881018] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 01:02:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1681076101] [2023-12-24 01:02:36,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:02:36,905 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 01:02:36,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 01:02:36,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 01:02:36,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-24 01:02:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:02:37,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 01:02:37,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:02:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 158 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-24 01:02:42,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:02:50,996 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-24 01:02:50,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1681076101] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 01:02:50,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-24 01:02:50,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 10] total 40 [2023-12-24 01:02:50,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592994] [2023-12-24 01:02:50,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-24 01:02:50,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-24 01:02:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:02:50,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-24 01:02:50,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1654, Unknown=0, NotChecked=0, Total=1980 [2023-12-24 01:02:50,999 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2023-12-24 01:03:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:03:04,157 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2023-12-24 01:03:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-12-24 01:03:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 69 [2023-12-24 01:03:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:03:04,160 INFO L225 Difference]: With dead ends: 170 [2023-12-24 01:03:04,160 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 01:03:04,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2842 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=1985, Invalid=7915, Unknown=0, NotChecked=0, Total=9900 [2023-12-24 01:03:04,167 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 112 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-24 01:03:04,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 334 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-24 01:03:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 01:03:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 01:03:04,168 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:03:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 01:03:04,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2023-12-24 01:03:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:03:04,169 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 01:03:04,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2023-12-24 01:03:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 01:03:04,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 01:03:04,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 01:03:04,185 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 01:03:04,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-12-24 01:03:04,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 01:03:04,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 01:03:10,773 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-24 01:03:10,773 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 01:03:10,773 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 01:03:10,773 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 01:03:10,773 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 01:03:10,774 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 01:03:10,774 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 56) no Hoare annotation was computed. [2023-12-24 01:03:10,774 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-12-24 01:03:10,774 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 40 42) no Hoare annotation was computed. [2023-12-24 01:03:10,774 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_14~0))) (and (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)) (fp.eq ~var_1_18~0 ~var_1_18~0) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:03:10,774 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_14~0))) (and (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)) (fp.eq ~var_1_18~0 ~var_1_18~0) (bvsge ((_ zero_extend 24) ~var_1_15~0) (_ bv1 32)) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:03:10,774 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 57) no Hoare annotation was computed. [2023-12-24 01:03:10,774 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-12-24 01:03:10,774 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 01:03:10,774 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 53) no Hoare annotation was computed. [2023-12-24 01:03:10,774 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_14~0)) (.cse3 ((_ zero_extend 24) ~var_1_15~0))) (and (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)) (let ((.cse2 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse1)) (fp.geq ~var_1_18~0 (fp.neg .cse2))) (and (fp.leq ~var_1_18~0 .cse2) (fp.geq ~var_1_18~0 .cse1)))) (bvsle .cse3 (_ bv1 32)) (bvsge .cse3 (_ bv1 32)) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:03:10,775 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_14~0)) (.cse3 ((_ zero_extend 24) ~var_1_15~0))) (and (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)) (let ((.cse2 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse1)) (fp.geq ~var_1_18~0 (fp.neg .cse2))) (and (fp.leq ~var_1_18~0 .cse2) (fp.geq ~var_1_18~0 .cse1)))) (bvsle .cse3 (_ bv1 32)) (bvsge .cse3 (_ bv1 32)) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:03:10,775 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-24 01:03:10,775 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (fp.eq ~var_1_18~0 ~var_1_18~0) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 01:03:10,775 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (bvsge ((_ zero_extend 24) ~var_1_14~0) (_ bv1 32)) (fp.eq ~var_1_18~0 ~var_1_18~0) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 01:03:10,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 01:03:10,775 INFO L895 garLoopResultBuilder]: At program point L87-3(lines 87 93) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (let ((.cse6 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_18~0 (fp.neg .cse5)) (fp.geq ~var_1_18~0 (fp.neg .cse6))) (and (fp.leq ~var_1_18~0 .cse6) (fp.geq ~var_1_18~0 .cse5)))) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 01:03:10,775 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-12-24 01:03:10,775 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-12-24 01:03:10,775 INFO L899 garLoopResultBuilder]: For program point L75(lines 58 76) no Hoare annotation was computed. [2023-12-24 01:03:10,775 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 01:03:10,775 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-24 01:03:10,775 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (fp.eq ~var_1_18~0 ~var_1_18~0) (= ~var_1_11~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 01:03:10,776 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (or (not (fp.gt (fp.neg (fp.add currentRoundingMode ~var_1_17~0 ~var_1_17~0)) ~var_1_17~0)) (let ((.cse2 (fp.eq ~var_1_17~0 ~var_1_18~0)) (.cse3 (= ~var_1_19~0 ~var_1_20~0)) (.cse4 ((_ zero_extend 24) ~var_1_13~0)) (.cse0 (= ~var_1_15~0 (_ bv0 8))) (.cse1 (= ~var_1_14~0 (_ bv0 8)))) (and (or .cse0 .cse1 (and .cse2 .cse3 (= (_ bv1 32) .cse4))) (or (and .cse2 .cse3 (= .cse4 (_ bv0 32))) (and (not .cse0) (not .cse1)))))) (fp.eq ~var_1_18~0 ~var_1_18~0) (= ~var_1_11~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 01:03:10,776 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ~var_1_14~0)) (.cse1 ((_ zero_extend 24) ~var_1_15~0))) (and (bvsge .cse0 (_ bv1 32)) (bvsle .cse0 (_ bv1 32)) (bvsle .cse1 (_ bv1 32)) (bvsge .cse1 (_ bv1 32)) (= ~var_1_11~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) ~var_1_12~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven))) [2023-12-24 01:03:10,776 INFO L899 garLoopResultBuilder]: For program point L72-1(line 72) no Hoare annotation was computed. [2023-12-24 01:03:10,776 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 01:03:10,776 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 01:03:10,776 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 01:03:10,776 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 01:03:10,779 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-24 01:03:10,781 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 01:03:10,796 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-12-24 01:03:10,796 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2023-12-24 01:03:10,797 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 01:03:10,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:03:10 BoogieIcfgContainer [2023-12-24 01:03:10,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 01:03:10,798 INFO L158 Benchmark]: Toolchain (without parser) took 52519.26ms. Allocated memory was 257.9MB in the beginning and 386.9MB in the end (delta: 129.0MB). Free memory was 203.9MB in the beginning and 155.4MB in the end (delta: 48.5MB). Peak memory consumption was 178.7MB. Max. memory is 8.0GB. [2023-12-24 01:03:10,798 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 188.7MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 01:03:10,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.25ms. Allocated memory is still 257.9MB. Free memory was 203.6MB in the beginning and 191.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 01:03:10,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.64ms. Allocated memory is still 257.9MB. Free memory was 191.1MB in the beginning and 189.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 01:03:10,799 INFO L158 Benchmark]: Boogie Preprocessor took 55.95ms. Allocated memory is still 257.9MB. Free memory was 189.3MB in the beginning and 186.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 01:03:10,799 INFO L158 Benchmark]: RCFGBuilder took 468.18ms. Allocated memory is still 257.9MB. Free memory was 186.5MB in the beginning and 169.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 01:03:10,799 INFO L158 Benchmark]: TraceAbstraction took 51696.72ms. Allocated memory was 257.9MB in the beginning and 386.9MB in the end (delta: 129.0MB). Free memory was 168.3MB in the beginning and 155.4MB in the end (delta: 12.9MB). Peak memory consumption was 143.1MB. Max. memory is 8.0GB. [2023-12-24 01:03:10,800 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.45ms. Allocated memory is still 188.7MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.25ms. Allocated memory is still 257.9MB. Free memory was 203.6MB in the beginning and 191.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.64ms. Allocated memory is still 257.9MB. Free memory was 191.1MB in the beginning and 189.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.95ms. Allocated memory is still 257.9MB. Free memory was 189.3MB in the beginning and 186.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 468.18ms. Allocated memory is still 257.9MB. Free memory was 186.5MB in the beginning and 169.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 51696.72ms. Allocated memory was 257.9MB in the beginning and 386.9MB in the end (delta: 129.0MB). Free memory was 168.3MB in the beginning and 155.4MB in the end (delta: 12.9MB). Peak memory consumption was 143.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.6s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 484 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 351 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1167 IncrementalHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 133 mSDtfsCounter, 1167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2885 ImplicationChecksByTransitivity, 23.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=2, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 70 PreInvPairs, 96 NumberOfFragments, 585 HoareAnnotationTreeSize, 70 FormulaSimplifications, 622 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FormulaSimplificationsInter, 3439 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 28.4s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 3505 SizeOfPredicates, 64 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1254/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((var_1_11 == 0) && (var_1_12 <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-24 01:03:10,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...