./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_operatoramount_amount25_file-35.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 bc33678a96b4cfd3f62b1c8cf60c6fd0186557133d9529f189083aa906b84f07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:21:03,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:21:04,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:21:04,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:21:04,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:21:04,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:21:04,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:21:04,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:21:04,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:21:04,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:21:04,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:21:04,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:21:04,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:21:04,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:21:04,040 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:21:04,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:21:04,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:21:04,040 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:21:04,041 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:21:04,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:21:04,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:21:04,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:21:04,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:21:04,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:21:04,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:21:04,043 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:21:04,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:21:04,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:21:04,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:21:04,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:21:04,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:21:04,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:21:04,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:21:04,043 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 -> bc33678a96b4cfd3f62b1c8cf60c6fd0186557133d9529f189083aa906b84f07 [2025-03-04 00:21:04,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:21:04,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:21:04,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:21:04,269 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:21:04,269 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:21:04,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.i [2025-03-04 00:21:05,359 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d522ce55b/1fb29b728e63459990cea898bc121dea/FLAGc5aa648a5 [2025-03-04 00:21:05,579 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:21:05,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.i [2025-03-04 00:21:05,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d522ce55b/1fb29b728e63459990cea898bc121dea/FLAGc5aa648a5 [2025-03-04 00:21:05,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d522ce55b/1fb29b728e63459990cea898bc121dea [2025-03-04 00:21:05,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:21:05,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:21:05,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:21:05,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:21:05,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:21:05,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a25ea27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05, skipping insertion in model container [2025-03-04 00:21:05,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:21:05,738 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_operatoramount_amount25_file-35.i[915,928] [2025-03-04 00:21:05,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:21:05,789 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:21:05,797 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_operatoramount_amount25_file-35.i[915,928] [2025-03-04 00:21:05,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:21:05,830 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:21:05,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05 WrapperNode [2025-03-04 00:21:05,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:21:05,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:21:05,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:21:05,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:21:05,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,867 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-03-04 00:21:05,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:21:05,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:21:05,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:21:05,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:21:05,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,891 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-04 00:21:05,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:21:05,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:21:05,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:21:05,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:21:05,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (1/1) ... [2025-03-04 00:21:05,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:21:05,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:21:05,930 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-04 00:21:05,932 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-04 00:21:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:21:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:21:05,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:21:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:21:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:21:05,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:21:05,994 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:21:05,995 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:21:06,185 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:21:06,185 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:21:06,191 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:21:06,191 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:21:06,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:21:06 BoogieIcfgContainer [2025-03-04 00:21:06,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:21:06,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:21:06,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:21:06,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:21:06,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:21:05" (1/3) ... [2025-03-04 00:21:06,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59bf27d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:21:06, skipping insertion in model container [2025-03-04 00:21:06,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:05" (2/3) ... [2025-03-04 00:21:06,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59bf27d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:21:06, skipping insertion in model container [2025-03-04 00:21:06,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:21:06" (3/3) ... [2025-03-04 00:21:06,198 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-35.i [2025-03-04 00:21:06,207 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:21:06,209 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-35.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:21:06,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:21:06,256 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;@703eae54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:21:06,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:21:06,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:21:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 00:21:06,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:21:06,269 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:21:06,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:21:06,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:21:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash 573458615, now seen corresponding path program 1 times [2025-03-04 00:21:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:21:06,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781533615] [2025-03-04 00:21:06,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:06,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:21:06,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 00:21:06,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 00:21:06,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:06,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:21:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 00:21:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:21:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781533615] [2025-03-04 00:21:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781533615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:21:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159305484] [2025-03-04 00:21:06,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:06,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:21:06,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:21:06,500 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-04 00:21:06,501 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-04 00:21:06,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 00:21:06,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 00:21:06,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:06,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:21:06,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:21:06,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:21:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 00:21:06,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:21:06,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159305484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:21:06,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:21:06,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:21:06,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041574129] [2025-03-04 00:21:06,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:21:06,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:21:06,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:21:06,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:21:06,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:21:06,687 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:21:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:21:06,702 INFO L93 Difference]: Finished difference Result 104 states and 171 transitions. [2025-03-04 00:21:06,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:21:06,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-03-04 00:21:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:21:06,707 INFO L225 Difference]: With dead ends: 104 [2025-03-04 00:21:06,707 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 00:21:06,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-04 00:21:06,710 INFO L435 NwaCegarLoop]: 74 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, 74 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-04 00:21:06,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:21:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 00:21:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 00:21:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:21:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-03-04 00:21:06,739 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 116 [2025-03-04 00:21:06,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:21:06,739 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-04 00:21:06,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:21:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-03-04 00:21:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 00:21:06,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:21:06,757 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:21:06,764 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-04 00:21:06,957 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-04 00:21:06,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:21:06,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:21:06,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1534804349, now seen corresponding path program 1 times [2025-03-04 00:21:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:21:06,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858144268] [2025-03-04 00:21:06,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:06,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:21:06,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 00:21:07,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 00:21:07,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:07,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:21:07,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:21:07,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 00:21:07,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 00:21:07,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:07,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:21:07,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:21:07,194 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:21:07,195 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:21:07,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:21:07,199 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:21:07,266 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:21:07,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:21:07 BoogieIcfgContainer [2025-03-04 00:21:07,270 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:21:07,271 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:21:07,271 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:21:07,271 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:21:07,272 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:21:06" (3/4) ... [2025-03-04 00:21:07,273 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:21:07,274 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:21:07,275 INFO L158 Benchmark]: Toolchain (without parser) took 1665.98ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 76.3MB in the end (delta: 30.7MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-03-04 00:21:07,275 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 167.8MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:21:07,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.07ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 94.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:21:07,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.88ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:21:07,276 INFO L158 Benchmark]: Boogie Preprocessor took 33.67ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 91.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:21:07,276 INFO L158 Benchmark]: IcfgBuilder took 289.90ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 74.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:21:07,277 INFO L158 Benchmark]: TraceAbstraction took 1076.47ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 76.3MB in the end (delta: -3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:21:07,277 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 76.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:21:07,278 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.44ms. Allocated memory is still 167.8MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.07ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 94.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.88ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.67ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 91.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 289.90ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 74.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1076.47ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 76.3MB in the end (delta: -3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 76.3MB 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 76, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryArithmeticFLOAToperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 4.8; [L23] unsigned long int var_1_2 = 2; [L24] unsigned long int var_1_3 = 5; [L25] float var_1_4 = 255.1; [L26] float var_1_5 = -0.6; [L27] signed short int var_1_6 = -10; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] signed char var_1_11 = -2; [L31] signed char var_1_12 = 10; [L32] signed char var_1_13 = 5; [L33] float var_1_14 = 499.375; [L34] float var_1_15 = 0.0; [L35] float var_1_16 = 63.2; [L36] float var_1_17 = 0.0; [L37] float var_1_18 = 15.75; [L38] float var_1_19 = 5.75; VAL [isInitial=0, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_2=2, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L69] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L69] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L72] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L73] var_1_4 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L74] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L75] var_1_5 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L76] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L78] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L80] var_1_8 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L82] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L82] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L84] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L85] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L85] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L87] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L88] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L88] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L89] var_1_15 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L90] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L91] var_1_16 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L92] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L93] var_1_17 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L94] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L95] var_1_18 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L96] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L109] RET updateVariables() [L110] CALL step() [L42] unsigned long int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=4294967263, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_2=4294967263, var_1_6=-10, var_1_7=0, var_1_8=1] [L43] COND TRUE stepLocal_0 >= (~ var_1_3) [L44] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_2=4294967263, var_1_3=32, var_1_6=-10, var_1_7=0, var_1_8=1] [L46] var_1_11 = (-32 + (var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13))))) [L47] signed char stepLocal_1 = var_1_12; VAL [isInitial=1, stepLocal_1=32, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=3995/8, var_1_19=23/4, var_1_2=4294967263, var_1_3=32, var_1_6=-10, var_1_7=0, var_1_8=1] [L48] COND FALSE !(stepLocal_1 != var_1_3) [L53] var_1_14 = var_1_18 VAL [isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=23/4, var_1_2=4294967263, var_1_3=32, var_1_6=-10, var_1_7=0, var_1_8=1] [L55] var_1_19 = var_1_5 VAL [isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-10, var_1_7=0, var_1_8=1] [L56] COND FALSE !(\read(var_1_7)) [L63] var_1_6 = var_1_11 VAL [isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-31, var_1_7=0, var_1_8=1] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return (((((var_1_2 >= (~ var_1_3)) ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) && (var_1_7 ? (var_1_8 ? (var_1_6 == ((signed short int) (var_1_11 + var_1_11))) : (var_1_6 == ((signed short int) (var_1_11 + var_1_11)))) : (var_1_6 == ((signed short int) var_1_11)))) && (var_1_11 == ((signed char) (-32 + (var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13)))))))) && ((var_1_12 != var_1_3) ? (var_1_7 ? (var_1_14 == ((float) ((var_1_15 - var_1_16) - (var_1_17 - var_1_18)))) : 1) : (var_1_14 == ((float) var_1_18)))) && (var_1_19 == ((float) var_1_5)) ; VAL [\result=0, isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-31, var_1_7=0, var_1_8=1] [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-31, var_1_7=0, var_1_8=1] [L19] reach_error() VAL [isInitial=1, var_1_11=-31, var_1_12=32, var_1_13=-31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-31, var_1_7=0, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 74 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:21:07,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_operatoramount_amount25_file-35.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 bc33678a96b4cfd3f62b1c8cf60c6fd0186557133d9529f189083aa906b84f07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:21:09,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:21:09,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:21:09,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:21:09,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:21:09,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:21:09,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:21:09,252 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:21:09,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:21:09,252 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:21:09,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:21:09,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:21:09,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:21:09,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:21:09,253 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:21:09,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:21:09,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:21:09,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:21:09,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:21:09,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:21:09,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:21:09,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:21:09,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:21:09,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:21:09,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:21:09,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:21:09,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:21:09,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:21:09,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:21:09,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:21:09,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:21:09,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:21:09,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:21:09,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:21:09,257 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 -> bc33678a96b4cfd3f62b1c8cf60c6fd0186557133d9529f189083aa906b84f07 [2025-03-04 00:21:09,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:21:09,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:21:09,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:21:09,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:21:09,507 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:21:09,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.i [2025-03-04 00:21:10,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a89112e/ccd630765e394870b263b526db74eaa7/FLAG715b24e83 [2025-03-04 00:21:10,861 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:21:10,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-35.i [2025-03-04 00:21:10,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a89112e/ccd630765e394870b263b526db74eaa7/FLAG715b24e83 [2025-03-04 00:21:10,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a89112e/ccd630765e394870b263b526db74eaa7 [2025-03-04 00:21:10,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:21:10,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:21:10,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:21:10,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:21:10,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:21:10,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:21:10" (1/1) ... [2025-03-04 00:21:10,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e090dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:10, skipping insertion in model container [2025-03-04 00:21:10,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:21:10" (1/1) ... [2025-03-04 00:21:10,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:21:11,019 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_operatoramount_amount25_file-35.i[915,928] [2025-03-04 00:21:11,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:21:11,075 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:21:11,086 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_operatoramount_amount25_file-35.i[915,928] [2025-03-04 00:21:11,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:21:11,122 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:21:11,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11 WrapperNode [2025-03-04 00:21:11,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:21:11,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:21:11,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:21:11,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:21:11,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,160 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-03-04 00:21:11,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:21:11,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:21:11,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:21:11,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:21:11,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,191 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-04 00:21:11,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:21:11,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:21:11,212 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:21:11,212 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:21:11,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (1/1) ... [2025-03-04 00:21:11,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:21:11,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:21:11,241 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-04 00:21:11,244 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-04 00:21:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:21:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:21:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:21:11,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:21:11,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:21:11,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:21:11,327 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:21:11,329 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:21:12,599 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:21:12,599 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:21:12,606 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:21:12,607 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:21:12,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:21:12 BoogieIcfgContainer [2025-03-04 00:21:12,607 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:21:12,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:21:12,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:21:12,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:21:12,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:21:10" (1/3) ... [2025-03-04 00:21:12,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4966d8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:21:12, skipping insertion in model container [2025-03-04 00:21:12,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:21:11" (2/3) ... [2025-03-04 00:21:12,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4966d8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:21:12, skipping insertion in model container [2025-03-04 00:21:12,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:21:12" (3/3) ... [2025-03-04 00:21:12,615 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-35.i [2025-03-04 00:21:12,625 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:21:12,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-35.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:21:12,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:21:12,680 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;@36065c5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:21:12,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:21:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:21:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 00:21:12,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:21:12,692 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:21:12,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:21:12,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:21:12,698 INFO L85 PathProgramCache]: Analyzing trace with hash 573458615, now seen corresponding path program 1 times [2025-03-04 00:21:12,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:21:12,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161462517] [2025-03-04 00:21:12,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:12,710 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-04 00:21:12,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:21:12,712 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-04 00:21:12,714 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-04 00:21:12,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 00:21:12,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 00:21:12,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:21:12,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:21:12,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:21:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-04 00:21:13,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:21:13,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:21:13,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161462517] [2025-03-04 00:21:13,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161462517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:21:13,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:21:13,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:21:13,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89210040] [2025-03-04 00:21:13,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:21:13,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:21:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:21:13,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:21:13,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:21:13,040 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:21:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:21:13,058 INFO L93 Difference]: Finished difference Result 104 states and 171 transitions. [2025-03-04 00:21:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:21:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-03-04 00:21:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:21:13,064 INFO L225 Difference]: With dead ends: 104 [2025-03-04 00:21:13,065 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 00:21:13,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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-04 00:21:13,070 INFO L435 NwaCegarLoop]: 74 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, 74 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-04 00:21:13,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:21:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 00:21:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 00:21:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:21:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-03-04 00:21:13,106 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 116 [2025-03-04 00:21:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:21:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-04 00:21:13,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:21:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-03-04 00:21:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 00:21:13,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:21:13,111 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:21:13,123 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-04 00:21:13,312 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-04 00:21:13,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:21:13,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:21:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1534804349, now seen corresponding path program 1 times [2025-03-04 00:21:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:21:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143926761] [2025-03-04 00:21:13,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:21:13,314 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-04 00:21:13,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:21:13,316 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-04 00:21:13,317 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-04 00:21:13,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 00:21:13,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 00:21:13,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:21:13,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:21:13,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 00:21:13,599 INFO L279 TraceCheckSpWp]: Computing forward predicates...