./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8d967df176a3fd5ac0c12ff3bbfde8cbb01bd6c0de3c75d24920428ec3dcf217 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:24:36,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:24:36,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:24:36,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:24:36,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:24:36,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:24:36,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:24:36,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:24:36,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:24:36,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:24:36,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:24:36,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:24:36,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:24:36,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:24:36,614 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:24:36,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:24:36,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:24:36,616 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:24:36,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:24:36,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:24:36,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:24:36,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:24:36,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:36,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:24:36,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:24:36,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:24:36,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:36,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:24:36,619 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 8d967df176a3fd5ac0c12ff3bbfde8cbb01bd6c0de3c75d24920428ec3dcf217 [2025-01-09 13:24:36,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:24:36,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:24:36,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:24:36,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:24:36,859 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:24:36,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i [2025-01-09 13:24:38,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c30b640d/e764ecd768034e658b13810f140ac637/FLAG2c0cd01c9 [2025-01-09 13:24:38,301 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:24:38,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i [2025-01-09 13:24:38,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c30b640d/e764ecd768034e658b13810f140ac637/FLAG2c0cd01c9 [2025-01-09 13:24:38,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c30b640d/e764ecd768034e658b13810f140ac637 [2025-01-09 13:24:38,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:24:38,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:24:38,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:24:38,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:24:38,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:24:38,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19cd529f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38, skipping insertion in model container [2025-01-09 13:24:38,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:24:38,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i[915,928] [2025-01-09 13:24:38,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:24:38,521 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:24:38,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i[915,928] [2025-01-09 13:24:38,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:24:38,562 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:24:38,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38 WrapperNode [2025-01-09 13:24:38,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:24:38,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:24:38,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:24:38,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:24:38,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,598 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-01-09 13:24:38,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:24:38,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:24:38,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:24:38,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:24:38,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,616 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]. [2025-01-09 13:24:38,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,624 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:24:38,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:24:38,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:24:38,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:24:38,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (1/1) ... [2025-01-09 13:24:38,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:38,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:24:38,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:24:38,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:24:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:24:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:24:38,688 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:24:38,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:24:38,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:24:38,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:24:38,730 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:24:38,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:24:38,865 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:24:38,865 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:24:38,871 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:24:38,872 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:24:38,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:24:38 BoogieIcfgContainer [2025-01-09 13:24:38,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:24:38,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:24:38,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:24:38,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:24:38,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:24:38" (1/3) ... [2025-01-09 13:24:38,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1c291b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:24:38, skipping insertion in model container [2025-01-09 13:24:38,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:38" (2/3) ... [2025-01-09 13:24:38,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1c291b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:24:38, skipping insertion in model container [2025-01-09 13:24:38,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:24:38" (3/3) ... [2025-01-09 13:24:38,881 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-93.i [2025-01-09 13:24:38,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:24:38,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-93.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:24:38,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:24:38,942 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;@405a2ed5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:24:38,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:24:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:24:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 13:24:38,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:24:38,955 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:24:38,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:24:38,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:24:38,960 INFO L85 PathProgramCache]: Analyzing trace with hash -654113923, now seen corresponding path program 1 times [2025-01-09 13:24:38,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:24:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114085479] [2025-01-09 13:24:38,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:38,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:24:39,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 13:24:39,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 13:24:39,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:39,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:24:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:24:39,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:24:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114085479] [2025-01-09 13:24:39,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114085479] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:24:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017910523] [2025-01-09 13:24:39,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:39,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:24:39,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:24:39,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:24:39,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:24:39,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 13:24:39,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 13:24:39,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:39,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:24:39,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:24:39,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:24:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:24:39,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:24:39,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017910523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:24:39,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:24:39,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:24:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366724250] [2025-01-09 13:24:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:24:39,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:24:39,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:24:39,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:24:39,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:24:39,348 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:24:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:24:39,371 INFO L93 Difference]: Finished difference Result 103 states and 171 transitions. [2025-01-09 13:24:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:24:39,373 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-01-09 13:24:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:24:39,377 INFO L225 Difference]: With dead ends: 103 [2025-01-09 13:24:39,378 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 13:24:39,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:24:39,382 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:24:39,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:24:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 13:24:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 13:24:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:24:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-01-09 13:24:39,408 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2025-01-09 13:24:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:24:39,409 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-01-09 13:24:39,409 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:24:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-01-09 13:24:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 13:24:39,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:24:39,410 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:24:39,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:24:39,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:24:39,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:24:39,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:24:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash -913090755, now seen corresponding path program 1 times [2025-01-09 13:24:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:24:39,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499603486] [2025-01-09 13:24:39,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:24:39,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 13:24:39,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 13:24:39,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:39,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:24:39,723 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:24:39,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 13:24:39,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 13:24:39,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:39,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:24:39,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:24:39,820 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:24:39,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:24:39,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:24:39,825 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 13:24:39,885 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:24:39,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:24:39 BoogieIcfgContainer [2025-01-09 13:24:39,888 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:24:39,888 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:24:39,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:24:39,889 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:24:39,889 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:24:38" (3/4) ... [2025-01-09 13:24:39,891 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:24:39,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:24:39,892 INFO L158 Benchmark]: Toolchain (without parser) took 1542.12ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 120.5MB in the end (delta: 7.3MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2025-01-09 13:24:39,892 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 226.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:24:39,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.17ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 115.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:24:39,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.20ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 113.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:24:39,893 INFO L158 Benchmark]: Boogie Preprocessor took 36.89ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 111.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:24:39,893 INFO L158 Benchmark]: RCFGBuilder took 236.06ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 96.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:24:39,893 INFO L158 Benchmark]: TraceAbstraction took 1013.48ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 120.6MB in the end (delta: -24.5MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2025-01-09 13:24:39,893 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 120.5MB in the end (delta: 21.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:24:39,895 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.76ms. Allocated memory is still 226.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.17ms. Allocated memory is still 167.8MB. Free memory was 127.9MB in the beginning and 115.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.20ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 113.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.89ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 111.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 236.06ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 96.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1013.48ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 120.6MB in the end (delta: -24.5MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 120.5MB in the end (delta: 21.5kB). 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 someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 50, overapproximation of someUnaryDOUBLEoperation at line 23, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.3; [L23] double var_1_3 = -0.9; [L24] double var_1_4 = 2.6; [L25] double var_1_5 = 128.5; [L26] float var_1_7 = 1.25; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 1; [L29] unsigned char var_1_10 = 0; [L30] signed char var_1_11 = -1; [L31] signed char var_1_12 = -10; [L32] signed char var_1_13 = -32; [L33] signed char var_1_14 = -2; [L34] unsigned long int var_1_15 = 500; [L35] unsigned long int var_1_16 = 16; [L36] float last_1_var_1_1 = 255.3; [L37] unsigned char last_1_var_1_8 = 0; VAL [isInitial=0, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L105] isInitial = 1 [L106] FCALL initially() [L107] int k_loop; [L108] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L108] COND TRUE k_loop < 1 [L109] CALL updateLastVariables() [L97] last_1_var_1_1 = var_1_1 [L98] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L109] RET updateLastVariables() [L110] CALL updateVariables() [L67] var_1_3 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L68] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L69] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L69] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_4=13/5, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L70] var_1_4 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L71] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_5=257/2, var_1_7=5/4, var_1_8=0, var_1_9=1] [L72] var_1_5 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L73] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L74] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_7=5/4, var_1_8=0, var_1_9=1] [L75] var_1_7 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L76] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L82] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=-10, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L84] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=-32, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-2, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L89] var_1_14 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=16, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_ulong() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=-2, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=-2, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=-2, var_1_1=2553/10, var_1_8=0, var_1_9=1] [L110] RET updateVariables() [L111] CALL step() [L41] COND FALSE !(((- last_1_var_1_1) / var_1_3) != (var_1_4 / var_1_5)) [L48] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=0, var_1_9=1] [L50] COND FALSE !(var_1_1 != var_1_1) [L55] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L57] COND FALSE !(var_1_1 < var_1_1) [L62] var_1_11 = (var_1_13 + var_1_14) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=500, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L64] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L111] RET step() [L112] CALL, EXPR property() [L101-L102] return ((((((- last_1_var_1_1) / var_1_3) != (var_1_4 / var_1_5)) ? (last_1_var_1_8 ? (var_1_1 == ((float) var_1_7)) : (var_1_1 == ((float) var_1_7))) : (var_1_1 == ((float) var_1_7))) && ((var_1_1 != var_1_1) ? ((var_1_1 < (var_1_1 * 15.25)) ? (var_1_8 == ((unsigned char) (! var_1_9))) : 1) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_1 < var_1_1) ? (var_1_10 ? (var_1_11 == ((signed char) var_1_12)) : 1) : (var_1_11 == ((signed char) (var_1_13 + var_1_14))))) && (var_1_15 == ((unsigned long int) var_1_16)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2553/10, last_1_var_1_8=0, var_1_10=0, var_1_11=-1, var_1_12=126, var_1_13=62, var_1_14=-63, var_1_15=-2, var_1_16=-2, var_1_1=505, var_1_7=505, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 76 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 13:24:39,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8d967df176a3fd5ac0c12ff3bbfde8cbb01bd6c0de3c75d24920428ec3dcf217 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:24:41,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:24:41,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:24:41,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:24:41,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:24:41,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:24:41,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:24:41,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:24:41,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:24:41,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:24:41,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:24:41,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:24:41,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:24:41,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:24:41,881 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:24:41,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:24:41,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:24:41,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:24:41,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:24:41,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:24:41,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:24:41,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:41,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:24:41,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:24:41,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:24:41,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:24:41,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:41,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:24:41,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:24:41,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:24:41,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:24:41,885 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:24:41,885 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:24:41,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:24:41,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:24:41,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:24:41,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:24:41,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 8d967df176a3fd5ac0c12ff3bbfde8cbb01bd6c0de3c75d24920428ec3dcf217 [2025-01-09 13:24:42,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:24:42,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:24:42,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:24:42,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:24:42,116 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:24:42,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i [2025-01-09 13:24:43,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44679c811/ab54a65516c741b5ae7a1f4707056820/FLAG1cc3fc36b [2025-01-09 13:24:43,499 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:24:43,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i [2025-01-09 13:24:43,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44679c811/ab54a65516c741b5ae7a1f4707056820/FLAG1cc3fc36b [2025-01-09 13:24:43,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44679c811/ab54a65516c741b5ae7a1f4707056820 [2025-01-09 13:24:43,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:24:43,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:24:43,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:24:43,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:24:43,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:24:43,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1885dd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43, skipping insertion in model container [2025-01-09 13:24:43,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:24:43,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i[915,928] [2025-01-09 13:24:43,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:24:43,724 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:24:43,733 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-93.i[915,928] [2025-01-09 13:24:43,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:24:43,766 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:24:43,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43 WrapperNode [2025-01-09 13:24:43,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:24:43,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:24:43,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:24:43,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:24:43,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,804 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-01-09 13:24:43,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:24:43,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:24:43,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:24:43,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:24:43,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,823 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]. [2025-01-09 13:24:43,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:24:43,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:24:43,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:24:43,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:24:43,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (1/1) ... [2025-01-09 13:24:43,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:24:43,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:24:43,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:24:43,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:24:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:24:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:24:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:24:43,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:24:43,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:24:43,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:24:43,936 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:24:43,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:24:54,892 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-01-09 13:24:54,892 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:24:54,899 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:24:54,899 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:24:54,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:24:54 BoogieIcfgContainer [2025-01-09 13:24:54,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:24:54,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:24:54,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:24:54,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:24:54,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:24:43" (1/3) ... [2025-01-09 13:24:54,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55aad084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:24:54, skipping insertion in model container [2025-01-09 13:24:54,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:24:43" (2/3) ... [2025-01-09 13:24:54,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55aad084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:24:54, skipping insertion in model container [2025-01-09 13:24:54,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:24:54" (3/3) ... [2025-01-09 13:24:54,907 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-93.i [2025-01-09 13:24:54,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:24:54,918 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-93.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:24:54,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:24:54,965 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;@7b20bb8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:24:54,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:24:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:24:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 13:24:54,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:24:54,975 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:24:54,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:24:54,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:24:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash -654113923, now seen corresponding path program 1 times [2025-01-09 13:24:54,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:24:54,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214388950] [2025-01-09 13:24:54,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:54,987 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 [2025-01-09 13:24:54,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:24:54,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-01-09 13:24:54,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 13:24:55,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 13:24:56,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 13:24:56,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:56,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:24:56,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:24:56,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:24:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-09 13:24:56,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:24:56,301 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:24:56,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214388950] [2025-01-09 13:24:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214388950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:24:56,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:24:56,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:24:56,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949147530] [2025-01-09 13:24:56,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:24:56,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:24:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:24:56,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:24:56,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:24:56,322 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:24:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:24:56,354 INFO L93 Difference]: Finished difference Result 102 states and 169 transitions. [2025-01-09 13:24:56,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:24:56,357 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-01-09 13:24:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:24:56,362 INFO L225 Difference]: With dead ends: 102 [2025-01-09 13:24:56,362 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 13:24:56,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:24:56,367 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:24:56,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:24:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 13:24:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 13:24:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:24:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-01-09 13:24:56,405 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 113 [2025-01-09 13:24:56,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:24:56,406 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-01-09 13:24:56,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:24:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2025-01-09 13:24:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 13:24:56,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:24:56,410 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:24:56,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 13:24:56,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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 [2025-01-09 13:24:56,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:24:56,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:24:56,611 INFO L85 PathProgramCache]: Analyzing trace with hash -913090755, now seen corresponding path program 1 times [2025-01-09 13:24:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:24:56,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481623299] [2025-01-09 13:24:56,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:24:56,612 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 [2025-01-09 13:24:56,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:24:56,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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) [2025-01-09 13:24:56,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 13:24:56,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 13:24:57,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 13:24:57,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:24:57,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:24:57,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 13:24:57,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:25:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 267 proven. 36 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-01-09 13:25:34,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:25:48,534 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:25:48,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:25:48,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481623299] [2025-01-09 13:25:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481623299] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 13:25:48,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:25:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-01-09 13:25:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839298578] [2025-01-09 13:25:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:25:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:25:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:25:48,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:25:48,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:25:48,539 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:25:53,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:25:57,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:26:01,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:26:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:26:06,697 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2025-01-09 13:26:06,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:26:06,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2025-01-09 13:26:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:26:06,699 INFO L225 Difference]: With dead ends: 85 [2025-01-09 13:26:06,699 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 13:26:06,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:26:06,700 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 60 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-01-09 13:26:06,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 346 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 16.8s Time] [2025-01-09 13:26:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 13:26:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2025-01-09 13:26:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 13:26:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2025-01-09 13:26:06,716 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 113 [2025-01-09 13:26:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:26:06,717 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2025-01-09 13:26:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:26:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2025-01-09 13:26:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 13:26:06,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:26:06,720 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:26:06,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 13:26:06,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 [2025-01-09 13:26:06,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:26:06,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:26:06,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1560451600, now seen corresponding path program 1 times [2025-01-09 13:26:06,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:26:06,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818232399] [2025-01-09 13:26:06,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:26:06,922 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 [2025-01-09 13:26:06,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:26:06,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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) [2025-01-09 13:26:06,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 13:26:06,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 13:26:08,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 13:26:08,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:26:08,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:26:08,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 13:26:08,230 INFO L279 TraceCheckSpWp]: Computing forward predicates...