./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 811e442ced91272f27290482f64220479ec828b108df11e4b6856fb1b291eb09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:17:20,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:17:20,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:17:20,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:17:20,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:17:20,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:17:20,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:17:20,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:17:20,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:17:20,612 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:17:20,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:17:20,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:17:20,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:17:20,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:17:20,613 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:17:20,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:17:20,614 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:17:20,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:17:20,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:17:20,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:17:20,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:17:20,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:17:20,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:17:20,615 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:17:20,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:17:20,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:17:20,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:17:20,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:17:20,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:17:20,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:17:20,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:17:20,616 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/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 -> 811e442ced91272f27290482f64220479ec828b108df11e4b6856fb1b291eb09 [2025-03-08 10:17:20,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:17:20,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:17:20,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:17:20,881 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:17:20,881 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:17:20,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i [2025-03-08 10:17:22,023 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd775ca28/fa48d810c71f4be790a163eb2859fd6a/FLAGe7db5db15 [2025-03-08 10:17:22,234 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:17:22,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i [2025-03-08 10:17:22,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd775ca28/fa48d810c71f4be790a163eb2859fd6a/FLAGe7db5db15 [2025-03-08 10:17:22,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd775ca28/fa48d810c71f4be790a163eb2859fd6a [2025-03-08 10:17:22,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:17:22,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:17:22,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:17:22,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:17:22,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:17:22,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714b2a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22, skipping insertion in model container [2025-03-08 10:17:22,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:17:22,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i[917,930] [2025-03-08 10:17:22,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:17:22,724 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:17:22,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i[917,930] [2025-03-08 10:17:22,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:17:22,762 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:17:22,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22 WrapperNode [2025-03-08 10:17:22,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:17:22,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:17:22,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:17:22,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:17:22,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,808 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2025-03-08 10:17:22,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:17:22,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:17:22,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:17:22,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:17:22,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,849 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-03-08 10:17:22,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:17:22,869 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:17:22,870 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:17:22,870 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:17:22,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (1/1) ... [2025-03-08 10:17:22,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:17:22,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:17:22,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:17:22,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:17:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:17:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:17:22,917 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:17:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:17:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:17:22,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:17:22,975 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:17:22,977 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:17:23,236 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-08 10:17:23,261 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 10:17:23,261 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:17:23,273 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:17:23,273 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:17:23,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:17:23 BoogieIcfgContainer [2025-03-08 10:17:23,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:17:23,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:17:23,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:17:23,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:17:23,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:17:22" (1/3) ... [2025-03-08 10:17:23,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2895e359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:17:23, skipping insertion in model container [2025-03-08 10:17:23,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:22" (2/3) ... [2025-03-08 10:17:23,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2895e359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:17:23, skipping insertion in model container [2025-03-08 10:17:23,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:17:23" (3/3) ... [2025-03-08 10:17:23,281 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-76.i [2025-03-08 10:17:23,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:17:23,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-76.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:17:23,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:17:23,353 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;@770b2058, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:17:23,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:17:23,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:17:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 10:17:23,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:17:23,370 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:17:23,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:17:23,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:17:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1212781103, now seen corresponding path program 1 times [2025-03-08 10:17:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:17:23,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792391363] [2025-03-08 10:17:23,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:17:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:17:23,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:17:23,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:17:23,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:23,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:17:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 10:17:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:17:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792391363] [2025-03-08 10:17:23,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792391363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:17:23,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24190306] [2025-03-08 10:17:23,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:17:23,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:17:23,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:17:23,628 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:17:23,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:17:23,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:17:23,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:17:23,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:23,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:17:23,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:17:23,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:17:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-08 10:17:23,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:17:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24190306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:17:23,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:17:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:17:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684499464] [2025-03-08 10:17:23,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:17:23,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:17:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:17:23,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:17:23,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:17:23,844 INFO L87 Difference]: Start difference. First operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:17:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:17:23,866 INFO L93 Difference]: Finished difference Result 148 states and 254 transitions. [2025-03-08 10:17:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:17:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 149 [2025-03-08 10:17:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:17:23,874 INFO L225 Difference]: With dead ends: 148 [2025-03-08 10:17:23,874 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 10:17:23,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-03-08 10:17:23,878 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:17:23,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:17:23,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 10:17:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-08 10:17:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:17:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2025-03-08 10:17:23,907 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 149 [2025-03-08 10:17:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:17:23,907 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2025-03-08 10:17:23,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:17:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2025-03-08 10:17:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 10:17:23,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:17:23,911 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:17:23,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:17:24,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:17:24,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:17:24,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:17:24,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2023831474, now seen corresponding path program 1 times [2025-03-08 10:17:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:17:24,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888702568] [2025-03-08 10:17:24,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:17:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:17:24,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:17:24,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:17:24,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:24,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:17:24,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [39478781] [2025-03-08 10:17:24,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:17:24,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:17:24,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:17:24,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:17:24,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:17:24,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:17:24,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:17:24,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:24,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:17:24,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:17:24,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 10:17:24,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 10:17:24,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:24,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:17:24,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:17:24,458 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:17:24,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:17:24,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:17:24,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 10:17:24,663 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 10:17:24,732 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:17:24,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:17:24 BoogieIcfgContainer [2025-03-08 10:17:24,734 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:17:24,735 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:17:24,735 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:17:24,735 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:17:24,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:17:23" (3/4) ... [2025-03-08 10:17:24,737 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:17:24,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:17:24,738 INFO L158 Benchmark]: Toolchain (without parser) took 2167.73ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 52.1MB in the end (delta: 55.5MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2025-03-08 10:17:24,738 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:17:24,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.72ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 94.1MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:17:24,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.42ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:17:24,741 INFO L158 Benchmark]: Boogie Preprocessor took 55.85ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:17:24,741 INFO L158 Benchmark]: IcfgBuilder took 404.56ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 68.0MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:17:24,741 INFO L158 Benchmark]: TraceAbstraction took 1458.73ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 52.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2025-03-08 10:17:24,741 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 142.6MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:17:24,742 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.21ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.72ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 94.1MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.42ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.85ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 88.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 404.56ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 68.0MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1458.73ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 52.2MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 142.6MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 41.6kB). 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 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed char var_1_9 = -16; [L31] signed long int var_1_10 = 1; [L32] signed long int var_1_11 = 4; [L33] signed long int var_1_12 = 0; [L34] signed long int var_1_13 = -16; [L35] unsigned short int var_1_14 = 10000; [L36] unsigned short int var_1_15 = 5; [L37] unsigned short int var_1_16 = 5; [L38] unsigned short int var_1_17 = 4; [L39] unsigned char var_1_18 = 100; [L40] unsigned char var_1_19 = 1; [L41] unsigned char var_1_20 = 8; VAL [isInitial=0, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L92] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L92] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_3=15/2, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L93] var_1_3 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L95] var_1_4 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L96] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L97] var_1_5 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L98] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4, var_1_9=-16] [L99] var_1_7 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L100] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L101] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L101] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=-16] [L102] var_1_9 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_9 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L103] RET assume_abort_if_not(var_1_9 >= -128) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L104] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L104] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L105] var_1_10 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L106] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L107] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L107] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=0, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L108] var_1_12 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_12 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L109] RET assume_abort_if_not(var_1_12 >= -1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L110] CALL assume_abort_if_not(var_1_12 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L110] RET assume_abort_if_not(var_1_12 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=-16, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L111] var_1_13 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_13 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L112] RET assume_abort_if_not(var_1_13 >= -1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L113] CALL assume_abort_if_not(var_1_13 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L113] RET assume_abort_if_not(var_1_13 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=5, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L114] var_1_15 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L115] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L116] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L116] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L117] var_1_16 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L118] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L119] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L119] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L120] var_1_19 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L121] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L122] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L122] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L123] var_1_20 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L124] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L125] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L125] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_2=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L138] RET updateVariables() [L139] CALL step() [L45] COND TRUE ! var_1_2 [L46] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L50] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L55] signed long int stepLocal_0 = var_1_10; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L56] COND FALSE !((var_1_6 * var_1_9) >= stepLocal_0) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L61] COND TRUE var_1_4 <= var_1_1 [L62] var_1_11 = (var_1_9 + -128) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L66] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L73] COND FALSE !(\read(var_1_2)) [L82] var_1_17 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L84] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L85] EXPR var_1_11 | var_1_6 VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L85] COND TRUE (var_1_14 + (var_1_11 | var_1_6)) > stepLocal_1 [L86] var_1_18 = (128 - (var_1_19 + var_1_20)) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=128, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_6 * var_1_9) >= var_1_10) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= var_1_1) ? (var_1_11 == ((signed long int) (var_1_9 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (var_1_9)) ? (-256) : (var_1_9))) + ((((var_1_12) < (((((var_1_13) > (256)) ? (var_1_13) : (256))))) ? (var_1_12) : (((((var_1_13) > (256)) ? (var_1_13) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_15)) : (var_1_14 == ((unsigned short int) var_1_16))) : 1)) && (var_1_2 ? ((var_1_1 == var_1_5) ? (((128 * ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10)))) > 1) ? (var_1_17 == ((unsigned short int) var_1_16)) : 1) : (var_1_17 == ((unsigned short int) var_1_15))) : (var_1_17 == ((unsigned short int) var_1_16)))) && (((var_1_14 + (var_1_11 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=128, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L130-L131] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_6 * var_1_9) >= var_1_10) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= var_1_1) ? (var_1_11 == ((signed long int) (var_1_9 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (var_1_9)) ? (-256) : (var_1_9))) + ((((var_1_12) < (((((var_1_13) > (256)) ? (var_1_13) : (256))))) ? (var_1_12) : (((((var_1_13) > (256)) ? (var_1_13) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_15)) : (var_1_14 == ((unsigned short int) var_1_16))) : 1)) && (var_1_2 ? ((var_1_1 == var_1_5) ? (((128 * ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10)))) > 1) ? (var_1_17 == ((unsigned short int) var_1_16)) : 1) : (var_1_17 == ((unsigned short int) var_1_15))) : (var_1_17 == ((unsigned short int) var_1_16)))) && (((var_1_14 + (var_1_11 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=128, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=-64, var_1_12=256, var_1_13=0, var_1_14=10000, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=128, var_1_19=0, var_1_1=2, var_1_20=0, var_1_2=0, var_1_3=2, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_8=21/4, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 141 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 111 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1980/2024 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-03-08 10:17:24,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 811e442ced91272f27290482f64220479ec828b108df11e4b6856fb1b291eb09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:17:26,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:17:26,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:17:26,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:17:26,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:17:26,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:17:26,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:17:26,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:17:26,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:17:26,649 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:17:26,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:17:26,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:17:26,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:17:26,650 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:17:26,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:17:26,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:17:26,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:17:26,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:17:26,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:17:26,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:17:26,655 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/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 -> 811e442ced91272f27290482f64220479ec828b108df11e4b6856fb1b291eb09 [2025-03-08 10:17:26,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:17:26,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:17:26,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:17:26,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:17:26,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:17:26,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i [2025-03-08 10:17:28,003 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40a7a8a8/621ffaf86e8847b098bf4543cab1a814/FLAG82c0609fb [2025-03-08 10:17:28,199 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:17:28,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i [2025-03-08 10:17:28,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40a7a8a8/621ffaf86e8847b098bf4543cab1a814/FLAG82c0609fb [2025-03-08 10:17:28,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40a7a8a8/621ffaf86e8847b098bf4543cab1a814 [2025-03-08 10:17:28,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:17:28,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:17:28,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:17:28,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:17:28,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:17:28,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7584b942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28, skipping insertion in model container [2025-03-08 10:17:28,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:17:28,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i[917,930] [2025-03-08 10:17:28,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:17:28,371 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:17:28,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-76.i[917,930] [2025-03-08 10:17:28,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:17:28,407 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:17:28,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28 WrapperNode [2025-03-08 10:17:28,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:17:28,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:17:28,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:17:28,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:17:28,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,445 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-08 10:17:28,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:17:28,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:17:28,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:17:28,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:17:28,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,474 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-03-08 10:17:28,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,488 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:17:28,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:17:28,493 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:17:28,494 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:17:28,494 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (1/1) ... [2025-03-08 10:17:28,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:17:28,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:17:28,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:17:28,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:17:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:17:28,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:17:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:17:28,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:17:28,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:17:28,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:17:28,621 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:17:28,622 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:17:40,953 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 10:17:40,953 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:17:40,961 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:17:40,962 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:17:40,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:17:40 BoogieIcfgContainer [2025-03-08 10:17:40,963 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:17:40,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:17:40,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:17:40,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:17:40,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:17:28" (1/3) ... [2025-03-08 10:17:40,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca30803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:17:40, skipping insertion in model container [2025-03-08 10:17:40,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:17:28" (2/3) ... [2025-03-08 10:17:40,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ca30803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:17:40, skipping insertion in model container [2025-03-08 10:17:40,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:17:40" (3/3) ... [2025-03-08 10:17:40,970 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-76.i [2025-03-08 10:17:40,979 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:17:40,980 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-76.i that has 2 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:17:41,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:17:41,023 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;@61e21c7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:17:41,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:17:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:17:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 10:17:41,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:17:41,034 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:17:41,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:17:41,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:17:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1651945980, now seen corresponding path program 1 times [2025-03-08 10:17:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:17:41,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039344495] [2025-03-08 10:17:41,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:17:41,050 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-03-08 10:17:41,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:17:41,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:17:41,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:17:41,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 10:17:41,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 10:17:41,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:41,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:17:41,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:17:41,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:17:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-03-08 10:17:41,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:17:41,808 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:17:41,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039344495] [2025-03-08 10:17:41,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039344495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:17:41,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:17:41,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:17:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392854241] [2025-03-08 10:17:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:17:41,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:17:41,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:17:41,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:17:41,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:17:41,830 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:17:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:17:41,853 INFO L93 Difference]: Finished difference Result 130 states and 226 transitions. [2025-03-08 10:17:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:17:41,856 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2025-03-08 10:17:41,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:17:41,862 INFO L225 Difference]: With dead ends: 130 [2025-03-08 10:17:41,862 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 10:17:41,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-03-08 10:17:41,868 INFO L435 NwaCegarLoop]: 99 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, 99 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-03-08 10:17:41,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:17:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 10:17:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-08 10:17:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 10:17:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2025-03-08 10:17:41,907 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 146 [2025-03-08 10:17:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:17:41,908 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2025-03-08 10:17:41,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 10:17:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2025-03-08 10:17:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 10:17:41,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:17:41,912 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:17:41,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:17:42,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:17:42,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:17:42,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:17:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash 812666721, now seen corresponding path program 1 times [2025-03-08 10:17:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:17:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353880319] [2025-03-08 10:17:42,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:17:42,114 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-03-08 10:17:42,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:17:42,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:17:42,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:17:42,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 10:17:42,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 10:17:42,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:17:42,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:17:42,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 10:17:42,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:17:56,286 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:18:06,700 WARN L286 SmtUtils]: Spent 7.62s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:18:15,469 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:18:23,564 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:18:29,333 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:18:37,594 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:18:45,348 WARN L286 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:18:53,629 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:19:01,400 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.lt c_~var_1_3~0 c_~var_1_4~0)) (.cse2 (= c_~var_1_5~0 c_~var_1_1~0))) (or (and .cse0 (let ((.cse1 (fp.lt c_~var_1_3~0 c_~var_1_5~0))) (or (and .cse1 (= c_~var_1_3~0 c_~var_1_1~0)) (and (not .cse1) .cse2)))) (and (not .cse0) (let ((.cse3 (fp.lt c_~var_1_4~0 c_~var_1_5~0))) (or (and .cse2 (not .cse3)) (and (= c_~var_1_4~0 c_~var_1_1~0) .cse3)))))) (not (fp.gt c_~var_1_5~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_7~0))) (= (_ bv0 8) c_~var_1_2~0)) is different from false [2025-03-08 10:19:05,478 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.lt c_~var_1_3~0 c_~var_1_4~0)) (.cse2 (= c_~var_1_5~0 c_~var_1_1~0))) (or (and .cse0 (let ((.cse1 (fp.lt c_~var_1_3~0 c_~var_1_5~0))) (or (and .cse1 (= c_~var_1_3~0 c_~var_1_1~0)) (and (not .cse1) .cse2)))) (and (not .cse0) (let ((.cse3 (fp.lt c_~var_1_4~0 c_~var_1_5~0))) (or (and .cse2 (not .cse3)) (and (= c_~var_1_4~0 c_~var_1_1~0) .cse3)))))) (not (fp.gt c_~var_1_5~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_7~0))) (= (_ bv0 8) c_~var_1_2~0)) is different from true