./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 152e91bdfeeca351de118ff3a888feb233fa9303b75d50bec7a3322cb6905be6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:15:52,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:15:52,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:15:52,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:15:52,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:15:52,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:15:52,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:15:52,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:15:52,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:15:52,600 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:15:52,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:15:52,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:15:52,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:15:52,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:15:52,601 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:15:52,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:15:52,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:15:52,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:15:52,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:15:52,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:15:52,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:15:52,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:15:52,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:15:52,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:15:52,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:15:52,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:15:52,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:15:52,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:15:52,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:15:52,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:15:52,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:15:52,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:15:52,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:15:52,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:15:52,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:15:52,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:15:52,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:15:52,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:15:52,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:15:52,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:15:52,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:15:52,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:15:52,608 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 152e91bdfeeca351de118ff3a888feb233fa9303b75d50bec7a3322cb6905be6 [2024-10-13 04:15:52,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:15:52,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:15:52,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:15:52,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:15:52,842 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:15:52,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i [2024-10-13 04:15:54,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:15:54,376 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:15:54,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i [2024-10-13 04:15:54,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56fc7332a/87b11fee95b6416d82b37724153f2201/FLAGa861d23c3 [2024-10-13 04:15:54,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56fc7332a/87b11fee95b6416d82b37724153f2201 [2024-10-13 04:15:54,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:15:54,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:15:54,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:15:54,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:15:54,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:15:54,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be88505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54, skipping insertion in model container [2024-10-13 04:15:54,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:15:54,583 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i[915,928] [2024-10-13 04:15:54,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:15:54,641 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:15:54,655 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i[915,928] [2024-10-13 04:15:54,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:15:54,684 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:15:54,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54 WrapperNode [2024-10-13 04:15:54,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:15:54,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:15:54,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:15:54,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:15:54,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,743 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-10-13 04:15:54,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:15:54,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:15:54,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:15:54,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:15:54,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,778 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:15:54,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:15:54,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:15:54,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:15:54,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:15:54,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (1/1) ... [2024-10-13 04:15:54,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:15:54,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:15:54,865 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:15:54,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:15:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:15:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:15:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:15:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:15:54,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:15:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:15:54,985 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:15:54,988 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:15:55,207 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 04:15:55,207 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:15:55,233 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:15:55,234 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:15:55,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:15:55 BoogieIcfgContainer [2024-10-13 04:15:55,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:15:55,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:15:55,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:15:55,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:15:55,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:15:54" (1/3) ... [2024-10-13 04:15:55,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414caf82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:15:55, skipping insertion in model container [2024-10-13 04:15:55,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:54" (2/3) ... [2024-10-13 04:15:55,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414caf82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:15:55, skipping insertion in model container [2024-10-13 04:15:55,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:15:55" (3/3) ... [2024-10-13 04:15:55,242 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-17.i [2024-10-13 04:15:55,256 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:15:55,256 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:15:55,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:15:55,309 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1380d26b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:15:55,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:15:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 04:15:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 04:15:55,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:15:55,332 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:15:55,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:15:55,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:15:55,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1809269583, now seen corresponding path program 1 times [2024-10-13 04:15:55,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:15:55,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612310854] [2024-10-13 04:15:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:15:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:15:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:15:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:15:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:15:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 04:15:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:15:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 04:15:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 04:15:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 04:15:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:15:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:15:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:15:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 04:15:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:15:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:15:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 04:15:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 04:15:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 04:15:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 04:15:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 04:15:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 04:15:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 04:15:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 04:15:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 04:15:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 04:15:55,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:15:55,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612310854] [2024-10-13 04:15:55,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612310854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:15:55,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:15:55,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:15:55,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105411900] [2024-10-13 04:15:55,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:15:55,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:15:55,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:15:55,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:15:55,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:15:55,702 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 04:15:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:15:55,744 INFO L93 Difference]: Finished difference Result 117 states and 205 transitions. [2024-10-13 04:15:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:15:55,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 140 [2024-10-13 04:15:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:15:55,753 INFO L225 Difference]: With dead ends: 117 [2024-10-13 04:15:55,754 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 04:15:55,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:15:55,761 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:15:55,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:15:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 04:15:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-13 04:15:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 04:15:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-10-13 04:15:55,829 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 140 [2024-10-13 04:15:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:15:55,831 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-10-13 04:15:55,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 04:15:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-10-13 04:15:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 04:15:55,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:15:55,835 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:15:55,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:15:55,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:15:55,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:15:55,839 INFO L85 PathProgramCache]: Analyzing trace with hash 845671433, now seen corresponding path program 1 times [2024-10-13 04:15:55,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:15:55,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743940372] [2024-10-13 04:15:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:15:55,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:15:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:15:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410846651] [2024-10-13 04:15:56,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:15:56,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:15:56,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:15:56,006 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:15:56,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:15:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:15:56,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:15:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:15:56,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:15:56,230 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:15:56,233 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:15:56,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:15:56,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:15:56,440 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 04:15:56,524 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:15:56,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:15:56 BoogieIcfgContainer [2024-10-13 04:15:56,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:15:56,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:15:56,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:15:56,528 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:15:56,528 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:15:55" (3/4) ... [2024-10-13 04:15:56,530 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:15:56,531 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:15:56,532 INFO L158 Benchmark]: Toolchain (without parser) took 2127.10ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 70.8MB in the beginning and 108.7MB in the end (delta: -37.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:15:56,532 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:15:56,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.34ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 56.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:15:56,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.33ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 56.5MB in the beginning and 149.6MB in the end (delta: -93.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-10-13 04:15:56,533 INFO L158 Benchmark]: Boogie Preprocessor took 70.72ms. Allocated memory is still 180.4MB. Free memory was 149.5MB in the beginning and 150.2MB in the end (delta: -710.5kB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-10-13 04:15:56,533 INFO L158 Benchmark]: RCFGBuilder took 418.62ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 132.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 04:15:56,533 INFO L158 Benchmark]: TraceAbstraction took 1290.94ms. Allocated memory is still 180.4MB. Free memory was 131.4MB in the beginning and 108.7MB in the end (delta: 22.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-10-13 04:15:56,533 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 180.4MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:15:56,535 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.34ms. Allocated memory is still 142.6MB. Free memory was 70.6MB in the beginning and 56.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.33ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 56.5MB in the beginning and 149.6MB in the end (delta: -93.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.72ms. Allocated memory is still 180.4MB. Free memory was 149.5MB in the beginning and 150.2MB in the end (delta: -710.5kB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * RCFGBuilder took 418.62ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 132.5MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1290.94ms. Allocated memory is still 180.4MB. Free memory was 131.4MB in the beginning and 108.7MB in the end (delta: 22.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 180.4MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10000000.8; [L23] double var_1_3 = 16.2; [L24] double var_1_4 = 7.5; [L25] double var_1_5 = 49.6; [L26] signed short int var_1_6 = -10; [L27] unsigned long int var_1_7 = 3280833198; [L28] unsigned long int var_1_8 = 10000000; [L29] signed short int var_1_10 = 1; [L30] signed long int var_1_11 = -32; [L31] double var_1_12 = 128.25; [L32] double var_1_13 = 4.4; [L33] signed long int var_1_14 = -1; [L34] signed long int var_1_15 = 4; [L35] signed long int var_1_16 = 64; [L36] signed long int var_1_17 = 4; [L37] unsigned char var_1_18 = 1; [L38] unsigned char var_1_19 = 1; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L56] var_1_3 = __VERIFIER_nondet_double() [L57] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L57] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L58] var_1_4 = __VERIFIER_nondet_double() [L59] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L59] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L60] var_1_5 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L61] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L62] var_1_7 = __VERIFIER_nondet_ulong() [L63] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L63] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L64] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L64] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=10000000] [L65] var_1_8 = __VERIFIER_nondet_ulong() [L66] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943] [L66] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943] [L67] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L67] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L68] var_1_10 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L69] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L70] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L70] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L71] var_1_12 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L72] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L73] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L73] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L74] var_1_13 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L75] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L76] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L76] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L77] var_1_14 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L78] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L79] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L79] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L80] var_1_15 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L82] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L82] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L83] var_1_16 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L84] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L85] CALL assume_abort_if_not(var_1_16 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L85] RET assume_abort_if_not(var_1_16 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L86] var_1_17 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L87] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L88] CALL assume_abort_if_not(var_1_17 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L88] RET assume_abort_if_not(var_1_17 <= 2147483646) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L89] var_1_19 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L90] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L91] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L91] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=-32, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L104] RET updateVariables() [L105] CALL step() [L42] COND TRUE (var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13)))) [L43] var_1_11 = (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L45] EXPR var_1_15 >> var_1_11 VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L45] COND TRUE ((var_1_15 >> var_1_11) * var_1_7) <= var_1_17 [L46] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L48] COND TRUE \read(var_1_18) [L49] var_1_1 = (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-10, var_1_7=6442450943, var_1_8=2147483647] [L51] COND TRUE (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11 [L52] var_1_6 = var_1_10 VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-32767, var_1_7=6442450943, var_1_8=2147483647] [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR (((var_1_18 ? (var_1_1 == ((double) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11) ? (var_1_6 == ((signed short int) var_1_10)) : 1)) && (((var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11 == ((signed long int) (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))))) : 1)) && ((((var_1_15 >> var_1_11) * var_1_7) <= var_1_17) ? (var_1_18 == ((unsigned char) var_1_19)) : 1) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-32767, var_1_7=6442450943, var_1_8=2147483647] [L96-L97] return (((var_1_18 ? (var_1_1 == ((double) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11) ? (var_1_6 == ((signed short int) var_1_10)) : 1)) && (((var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11 == ((signed long int) (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))))) : 1)) && ((((var_1_15 >> var_1_11) * var_1_7) <= var_1_17) ? (var_1_18 == ((unsigned char) var_1_19)) : 1) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-32767, var_1_7=6442450943, var_1_8=2147483647] [L19] reach_error() VAL [isInitial=1, var_1_10=-32767, var_1_11=1, var_1_14=-1, var_1_15=0, var_1_16=1, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-32767, var_1_7=6442450943, var_1_8=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 84 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1012/1012 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:15:56,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 152e91bdfeeca351de118ff3a888feb233fa9303b75d50bec7a3322cb6905be6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:15:58,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:15:58,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:15:58,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:15:58,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:15:58,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:15:58,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:15:58,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:15:58,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:15:58,620 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:15:58,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:15:58,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:15:58,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:15:58,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:15:58,621 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:15:58,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:15:58,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:15:58,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:15:58,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:15:58,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:15:58,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:15:58,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:15:58,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:15:58,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:15:58,630 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:15:58,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:15:58,630 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:15:58,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:15:58,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:15:58,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:15:58,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:15:58,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:15:58,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:15:58,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:15:58,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:15:58,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:15:58,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:15:58,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:15:58,632 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:15:58,633 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:15:58,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:15:58,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:15:58,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:15:58,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:15:58,637 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:15:58,637 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 152e91bdfeeca351de118ff3a888feb233fa9303b75d50bec7a3322cb6905be6 [2024-10-13 04:15:58,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:15:58,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:15:58,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:15:58,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:15:58,944 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:15:58,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i [2024-10-13 04:16:00,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:16:00,525 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:16:00,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i [2024-10-13 04:16:00,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b352769/7342f78e292e467fa9add94d4ad8701e/FLAG83995af53 [2024-10-13 04:16:00,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b352769/7342f78e292e467fa9add94d4ad8701e [2024-10-13 04:16:00,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:16:00,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:16:00,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:16:00,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:16:00,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:16:00,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d32f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00, skipping insertion in model container [2024-10-13 04:16:00,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,581 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:16:00,728 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i[915,928] [2024-10-13 04:16:00,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:16:00,794 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:16:00,805 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-17.i[915,928] [2024-10-13 04:16:00,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:16:00,840 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:16:00,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00 WrapperNode [2024-10-13 04:16:00,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:16:00,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:16:00,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:16:00,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:16:00,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,888 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-13 04:16:00,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:16:00,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:16:00,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:16:00,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:16:00,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,905 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,917 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:16:00,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:16:00,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:16:00,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:16:00,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:16:00,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (1/1) ... [2024-10-13 04:16:00,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:16:00,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:16:00,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:16:01,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:16:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:16:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:16:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:16:01,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:16:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:16:01,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:16:01,137 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:16:01,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:16:15,598 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 04:16:15,599 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:16:15,650 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:16:15,650 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:16:15,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:16:15 BoogieIcfgContainer [2024-10-13 04:16:15,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:16:15,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:16:15,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:16:15,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:16:15,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:16:00" (1/3) ... [2024-10-13 04:16:15,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d3e8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:16:15, skipping insertion in model container [2024-10-13 04:16:15,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:16:00" (2/3) ... [2024-10-13 04:16:15,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d3e8d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:16:15, skipping insertion in model container [2024-10-13 04:16:15,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:16:15" (3/3) ... [2024-10-13 04:16:15,661 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-17.i [2024-10-13 04:16:15,676 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:16:15,676 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:16:15,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:16:15,741 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d149997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:16:15,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:16:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 04:16:15,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 04:16:15,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:16:15,759 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:16:15,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:16:15,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:16:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 347085318, now seen corresponding path program 1 times [2024-10-13 04:16:15,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:16:15,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038795289] [2024-10-13 04:16:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:16:15,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:16:15,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:16:15,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:16:15,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:16:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:16:16,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:16:16,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:16:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-10-13 04:16:17,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:16:17,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:16:17,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038795289] [2024-10-13 04:16:17,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038795289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:16:17,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:16:17,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:16:17,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727093678] [2024-10-13 04:16:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:16:17,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:16:17,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:16:17,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:16:17,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:16:17,034 INFO L87 Difference]: Start difference. First operand has 53 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 04:16:21,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:16:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:16:21,699 INFO L93 Difference]: Finished difference Result 103 states and 185 transitions. [2024-10-13 04:16:21,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:16:21,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 137 [2024-10-13 04:16:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:16:21,932 INFO L225 Difference]: With dead ends: 103 [2024-10-13 04:16:21,933 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 04:16:21,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:16:21,939 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:16:21,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 04:16:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 04:16:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-13 04:16:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 04:16:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2024-10-13 04:16:21,976 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 137 [2024-10-13 04:16:21,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:16:21,976 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2024-10-13 04:16:21,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 04:16:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2024-10-13 04:16:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 04:16:21,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:16:21,979 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:16:22,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 04:16:22,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:16:22,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:16:22,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:16:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1242348428, now seen corresponding path program 1 times [2024-10-13 04:16:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:16:22,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765111108] [2024-10-13 04:16:22,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:16:22,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:16:22,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:16:22,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:16:22,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:16:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:16:23,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 04:16:23,489 INFO L278 TraceCheckSpWp]: Computing forward predicates...