./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.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_variablewrapping_normal_file-95.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 afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:00:44,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:00:44,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:00:44,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:00:44,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:00:44,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:00:44,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:00:44,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:00:44,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:00:44,499 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:00:44,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:00:44,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:00:44,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:00:44,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:00:44,500 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:00:44,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:00:44,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:00:44,500 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:00:44,501 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:00:44,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:00:44,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:00:44,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:00:44,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:44,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:00:44,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:00:44,502 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:00:44,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:00:44,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:00:44,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:00:44,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:00:44,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:00:44,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:00:44,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:00:44,503 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 -> afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab [2025-03-04 01:00:44,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:00:44,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:00:44,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:00:44,727 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:00:44,728 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:00:44,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i [2025-03-04 01:00:45,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5a22517/af575d8787ab4175b48c90b2009568ac/FLAG209af7a18 [2025-03-04 01:00:46,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:00:46,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i [2025-03-04 01:00:46,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5a22517/af575d8787ab4175b48c90b2009568ac/FLAG209af7a18 [2025-03-04 01:00:46,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5a22517/af575d8787ab4175b48c90b2009568ac [2025-03-04 01:00:46,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:00:46,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:00:46,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:46,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:00:46,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:00:46,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46, skipping insertion in model container [2025-03-04 01:00:46,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:00:46,183 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_variablewrapping_normal_file-95.i[913,926] [2025-03-04 01:00:46,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:46,243 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:00:46,251 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_variablewrapping_normal_file-95.i[913,926] [2025-03-04 01:00:46,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:46,288 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:00:46,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46 WrapperNode [2025-03-04 01:00:46,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:46,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:46,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:00:46,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:00:46,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,338 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2025-03-04 01:00:46,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:46,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:00:46,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:00:46,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:00:46,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,365 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 01:00:46,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:00:46,388 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:00:46,389 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:00:46,389 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:00:46,389 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:46,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:00:46,412 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 01:00:46,417 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 01:00:46,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:00:46,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:00:46,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:00:46,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:00:46,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:00:46,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:00:46,486 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:00:46,488 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:00:46,734 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: havoc property_#t~bitwise15#1;havoc property_#t~short16#1;havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2025-03-04 01:00:46,767 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-04 01:00:46,769 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:00:46,792 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:00:46,793 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:00:46,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:46 BoogieIcfgContainer [2025-03-04 01:00:46,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:00:46,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:00:46,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:00:46,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:00:46,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:00:46" (1/3) ... [2025-03-04 01:00:46,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db6b064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:00:46, skipping insertion in model container [2025-03-04 01:00:46,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (2/3) ... [2025-03-04 01:00:46,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db6b064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:00:46, skipping insertion in model container [2025-03-04 01:00:46,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:46" (3/3) ... [2025-03-04 01:00:46,803 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-95.i [2025-03-04 01:00:46,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:00:46,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-95.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:00:46,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:00:46,863 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;@3a5b3a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:00:46,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:00:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:00:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:00:46,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:00:46,874 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:46,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:00:46,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:00:46,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1263694676, now seen corresponding path program 1 times [2025-03-04 01:00:46,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:00:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-04 01:00:46,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:00:46,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:00:47,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:00:47,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:47,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:00:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:00:47,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:00:47,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-04 01:00:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967039731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:00:47,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:00:47,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:00:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277671531] [2025-03-04 01:00:47,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:00:47,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:00:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:00:47,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:00:47,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:00:47,456 INFO L87 Difference]: Start difference. First operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:00:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:00:47,495 INFO L93 Difference]: Finished difference Result 121 states and 195 transitions. [2025-03-04 01:00:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:00:47,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2025-03-04 01:00:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:00:47,503 INFO L225 Difference]: With dead ends: 121 [2025-03-04 01:00:47,503 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 01:00:47,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:00:47,510 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:00:47,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:00:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 01:00:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-04 01:00:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:00:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2025-03-04 01:00:47,539 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 107 [2025-03-04 01:00:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:00:47,541 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2025-03-04 01:00:47,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:00:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2025-03-04 01:00:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:00:47,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:00:47,545 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:47,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 01:00:47,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:00:47,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:00:47,547 INFO L85 PathProgramCache]: Analyzing trace with hash 746282565, now seen corresponding path program 1 times [2025-03-04 01:00:47,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:00:47,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131114369] [2025-03-04 01:00:47,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:47,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:00:47,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:00:47,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:00:47,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:47,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:00:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056640750] [2025-03-04 01:00:47,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:47,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:00:47,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:00:47,604 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 01:00:47,605 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 01:00:47,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:00:47,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:00:47,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:47,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:00:47,703 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:00:47,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:00:47,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:00:47,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:47,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:00:47,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:00:47,785 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:00:47,785 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:00:47,793 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 01:00:47,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:00:47,991 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 01:00:48,045 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:00:48,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:00:48 BoogieIcfgContainer [2025-03-04 01:00:48,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:00:48,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:00:48,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:00:48,050 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:00:48,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:46" (3/4) ... [2025-03-04 01:00:48,052 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:00:48,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:00:48,054 INFO L158 Benchmark]: Toolchain (without parser) took 1994.94ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 80.9MB in the end (delta: 41.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2025-03-04 01:00:48,054 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:48,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.29ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 110.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:00:48,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.36ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 106.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:48,055 INFO L158 Benchmark]: Boogie Preprocessor took 45.98ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 102.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:48,055 INFO L158 Benchmark]: IcfgBuilder took 406.23ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 81.7MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 01:00:48,055 INFO L158 Benchmark]: TraceAbstraction took 1251.65ms. Allocated memory is still 167.8MB. Free memory was 80.6MB in the beginning and 81.9MB in the end (delta: -1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:48,055 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 167.8MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 997.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:48,057 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.29ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 110.1MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.36ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 106.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.98ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 102.8MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 406.23ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 81.7MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1251.65ms. Allocated memory is still 167.8MB. Free memory was 80.6MB in the beginning and 81.9MB in the end (delta: -1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 167.8MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 997.8kB). 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 63, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryArithmeticFLOAToperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] float var_1_3 = 1.8; [L24] float var_1_4 = 8.54; [L25] float var_1_5 = 255.8; [L26] float var_1_6 = 50.4; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 5; [L31] unsigned char var_1_12 = 2; [L32] signed short int var_1_13 = 0; [L33] unsigned long int var_1_14 = 16; [L34] signed char var_1_16 = -1; [L35] signed char var_1_17 = -16; [L36] unsigned char last_1_var_1_7 = 0; VAL [isInitial=0, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_4=427/50, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L85] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_4=427/50, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L58] var_1_4 = __VERIFIER_nondet_float() [L59] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L59] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_5=1279/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L60] var_1_5 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L61] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_6=252/5, var_1_7=0, var_1_8=8] [L62] var_1_6 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=8] [L63] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=8] [L64] var_1_8 = __VERIFIER_nondet_ulong() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0] [L66] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L66] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=32, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L67] var_1_10 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L68] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L69] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L69] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=5, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L70] var_1_11 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L71] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L72] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L72] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=2, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L73] var_1_12 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L74] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L75] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L75] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=16, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L76] var_1_14 = __VERIFIER_nondet_ulong() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L78] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L78] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L79] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L79] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=-16, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L80] var_1_17 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L81] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L82] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L82] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=-1, var_1_17=0, var_1_1=-64, var_1_3=9/5, var_1_7=0, var_1_8=10737418239] [L96] RET updateVariables() [L97] CALL step() [L40] var_1_1 = ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))) [L41] var_1_3 = ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f))))) [L42] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=10737418239] [L43] EXPR var_1_16 & var_1_1 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=10737418239] [L43] signed long int stepLocal_0 = var_1_16 & var_1_1; [L44] COND TRUE (- (3351680781u - var_1_8)) > stepLocal_0 [L45] var_1_7 = (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=10737418239] [L47] EXPR var_1_7 >> var_1_7 VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=10737418239] [L47] COND FALSE !((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) [L50] COND TRUE var_1_16 >= var_1_1 [L51] var_1_13 = (-5 + (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=-5, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=10737418239] [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR ((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((float) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=-5, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=10737418239] [L88] EXPR (((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((float) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256)))) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=-5, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=10737418239] [L88-L89] return ((((var_1_1 == ((signed long int) ((((last_1_var_1_7) < 0 ) ? -(last_1_var_1_7) : (last_1_var_1_7))))) && (var_1_3 == ((float) ((var_1_4 - var_1_5) + ((((256.5f) < ((var_1_6 - 16.125f))) ? (256.5f) : ((var_1_6 - 16.125f)))))))) && (((- (3351680781u - var_1_8)) > (var_1_16 & var_1_1)) ? (var_1_7 == ((unsigned char) (((((var_1_10) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (var_1_10) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) + var_1_12))) : 1)) && (((var_1_16 / var_1_14) < (var_1_7 >> var_1_7)) ? (var_1_13 == ((signed short int) ((((4 - var_1_11) < 0 ) ? -(4 - var_1_11) : (4 - var_1_11))))) : ((var_1_16 >= var_1_1) ? (var_1_13 == ((signed short int) (-5 + (var_1_12 - var_1_11)))) : (var_1_13 == ((signed short int) 256))))) && (var_1_16 == ((signed char) var_1_17)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=-5, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=10737418239] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=0, var_1_10=127, var_1_11=256, var_1_12=0, var_1_13=-5, var_1_14=1, var_1_16=0, var_1_17=0, var_1_1=0, var_1_7=0, var_1_8=10737418239] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 81 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 3, 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.4s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 480/480 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 01:00:48,077 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_variablewrapping_normal_file-95.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 afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:00:49,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:00:50,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:00:50,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:00:50,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:00:50,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:00:50,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:00:50,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:00:50,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:00:50,059 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:00:50,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:00:50,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:00:50,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:00:50,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:00:50,059 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:00:50,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:00:50,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:00:50,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:00:50,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:00:50,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:00:50,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:00:50,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:00:50,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:00:50,062 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:00:50,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:50,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:00:50,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:00:50,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:00:50,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:00:50,063 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:00:50,063 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:00:50,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:00:50,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:00:50,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:00:50,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:00:50,063 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 -> afae07a7e8a468ecc7c0f4a08803b8b183d56b14bf458e30f12588ce54318aab [2025-03-04 01:00:50,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:00:50,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:00:50,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:00:50,316 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:00:50,316 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:00:50,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i [2025-03-04 01:00:51,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe74d0c9/5e49a5801a0a4aafa138a8aeb828b9fc/FLAG9bc565842 [2025-03-04 01:00:51,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:00:51,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-95.i [2025-03-04 01:00:51,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe74d0c9/5e49a5801a0a4aafa138a8aeb828b9fc/FLAG9bc565842 [2025-03-04 01:00:51,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe74d0c9/5e49a5801a0a4aafa138a8aeb828b9fc [2025-03-04 01:00:51,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:00:51,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:00:51,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:51,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:00:51,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:00:51,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:51,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f311716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51, skipping insertion in model container [2025-03-04 01:00:51,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:51,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:00:51,850 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_variablewrapping_normal_file-95.i[913,926] [2025-03-04 01:00:51,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:51,909 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:00:51,918 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_variablewrapping_normal_file-95.i[913,926] [2025-03-04 01:00:51,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:51,955 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:00:51,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51 WrapperNode [2025-03-04 01:00:51,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:51,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:51,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:00:51,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:00:51,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:51,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:51,985 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2025-03-04 01:00:51,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:51,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:00:51,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:00:51,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:00:51,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:51,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:52,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:52,016 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 01:00:52,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:52,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:52,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:52,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:52,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:52,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:52,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:00:52,036 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:00:52,036 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:00:52,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:00:52,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (1/1) ... [2025-03-04 01:00:52,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:52,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:00:52,069 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 01:00:52,074 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 01:00:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:00:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:00:52,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:00:52,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:00:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:00:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:00:52,147 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:00:52,148 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:00:54,007 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 01:00:54,007 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:00:54,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:00:54,016 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:00:54,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:54 BoogieIcfgContainer [2025-03-04 01:00:54,016 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:00:54,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:00:54,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:00:54,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:00:54,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:00:51" (1/3) ... [2025-03-04 01:00:54,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef96db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:00:54, skipping insertion in model container [2025-03-04 01:00:54,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:51" (2/3) ... [2025-03-04 01:00:54,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef96db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:00:54, skipping insertion in model container [2025-03-04 01:00:54,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:54" (3/3) ... [2025-03-04 01:00:54,025 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-95.i [2025-03-04 01:00:54,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:00:54,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-95.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:00:54,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:00:54,085 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;@625e0899, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:00:54,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:00:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:00:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:00:54,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:00:54,097 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:54,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:00:54,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:00:54,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1863533241, now seen corresponding path program 1 times [2025-03-04 01:00:54,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:00:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901554279] [2025-03-04 01:00:54,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:54,108 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 01:00:54,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:00:54,110 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 01:00:54,112 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 01:00:54,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:00:54,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:00:54,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:54,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:00:54,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:00:54,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:00:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2025-03-04 01:00:54,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:00:54,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:00:54,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901554279] [2025-03-04 01:00:54,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901554279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:00:54,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:00:54,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:00:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711228383] [2025-03-04 01:00:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:00:54,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:00:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:00:54,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:00:54,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:00:54,458 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:00:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:00:54,472 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2025-03-04 01:00:54,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:00:54,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2025-03-04 01:00:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:00:54,478 INFO L225 Difference]: With dead ends: 86 [2025-03-04 01:00:54,478 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 01:00:54,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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 01:00:54,484 INFO L435 NwaCegarLoop]: 60 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, 60 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 01:00:54,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:00:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 01:00:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 01:00:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:00:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2025-03-04 01:00:54,510 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 100 [2025-03-04 01:00:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:00:54,510 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2025-03-04 01:00:54,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:00:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2025-03-04 01:00:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 01:00:54,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:00:54,513 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:54,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:00:54,713 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 01:00:54,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:00:54,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:00:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1972359847, now seen corresponding path program 1 times [2025-03-04 01:00:54,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:00:54,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372087208] [2025-03-04 01:00:54,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:54,715 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 01:00:54,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:00:54,718 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 01:00:54,719 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 01:00:54,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:00:54,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:00:54,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:54,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:00:54,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:00:54,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:01:41,168 WARN L286 SmtUtils]: Spent 17.06s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)