./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-50.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 a6ea67ec5141ba30c704987a9668199f8d55bb535d4080241ca9c1a7de14e100 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:13:16,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:13:16,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:13:16,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:13:16,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:13:16,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:13:16,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:13:16,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:13:16,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:13:16,668 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:13:16,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:13:16,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:13:16,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:13:16,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:13:16,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:13:16,671 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:13:16,671 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:13:16,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:13:16,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:13:16,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:13:16,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:13:16,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:13:16,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:13:16,672 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:13:16,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:13:16,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:13:16,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:13:16,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:13:16,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:13:16,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:13:16,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:13:16,673 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 -> a6ea67ec5141ba30c704987a9668199f8d55bb535d4080241ca9c1a7de14e100 [2025-03-17 05:13:16,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:13:16,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:13:16,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:13:16,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:13:16,923 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:13:16,924 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-50.i [2025-03-17 05:13:18,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74f8cf80/79726903b0ff4bab9c3510b06a4248f3/FLAG56ac18711 [2025-03-17 05:13:18,308 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:13:18,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-50.i [2025-03-17 05:13:18,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74f8cf80/79726903b0ff4bab9c3510b06a4248f3/FLAG56ac18711 [2025-03-17 05:13:18,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d74f8cf80/79726903b0ff4bab9c3510b06a4248f3 [2025-03-17 05:13:18,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:13:18,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:13:18,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:13:18,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:13:18,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:13:18,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416ac67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18, skipping insertion in model container [2025-03-17 05:13:18,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:13:18,756 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-50.i[913,926] [2025-03-17 05:13:18,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:13:18,791 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:13:18,798 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-50.i[913,926] [2025-03-17 05:13:18,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:13:18,822 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:13:18,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18 WrapperNode [2025-03-17 05:13:18,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:13:18,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:13:18,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:13:18,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:13:18,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,855 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2025-03-17 05:13:18,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:13:18,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:13:18,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:13:18,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:13:18,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,883 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-17 05:13:18,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:13:18,898 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:13:18,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:13:18,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:13:18,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (1/1) ... [2025-03-17 05:13:18,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:13:18,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:13:18,927 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-17 05:13:18,929 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-17 05:13:18,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:13:18,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:13:18,944 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:13:18,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:13:18,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:13:18,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:13:18,991 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:13:18,993 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:13:19,213 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 05:13:19,216 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:13:19,224 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:13:19,224 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:13:19,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:13:19 BoogieIcfgContainer [2025-03-17 05:13:19,224 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:13:19,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:13:19,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:13:19,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:13:19,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:13:18" (1/3) ... [2025-03-17 05:13:19,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f454968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:13:19, skipping insertion in model container [2025-03-17 05:13:19,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:18" (2/3) ... [2025-03-17 05:13:19,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f454968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:13:19, skipping insertion in model container [2025-03-17 05:13:19,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:13:19" (3/3) ... [2025-03-17 05:13:19,231 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-50.i [2025-03-17 05:13:19,241 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:13:19,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-50.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:13:19,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:13:19,298 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;@4803764b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:13:19,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:13:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:13:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:13:19,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:13:19,313 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:13:19,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:13:19,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:13:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1289355142, now seen corresponding path program 1 times [2025-03-17 05:13:19,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:13:19,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204996118] [2025-03-17 05:13:19,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:13:19,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:13:19,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:13:19,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:13:19,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:13:19,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:13:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 05:13:19,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:13:19,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204996118] [2025-03-17 05:13:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204996118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:13:19,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642253516] [2025-03-17 05:13:19,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:13:19,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:13:19,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:13:19,541 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-17 05:13:19,542 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-17 05:13:19,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:13:19,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:13:19,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:13:19,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:13:19,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:13:19,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:13:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-17 05:13:19,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:13:19,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642253516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:13:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:13:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:13:19,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128148717] [2025-03-17 05:13:19,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:13:19,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:13:19,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:13:19,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:13:19,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:13:19,737 INFO L87 Difference]: Start difference. First operand has 62 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:13:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:13:19,753 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2025-03-17 05:13:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:13:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 155 [2025-03-17 05:13:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:13:19,759 INFO L225 Difference]: With dead ends: 121 [2025-03-17 05:13:19,760 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 05:13:19,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-17 05:13:19,764 INFO L435 NwaCegarLoop]: 91 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, 91 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-17 05:13:19,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:13:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 05:13:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 05:13:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:13:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2025-03-17 05:13:19,796 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 155 [2025-03-17 05:13:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:13:19,796 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2025-03-17 05:13:19,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:13:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2025-03-17 05:13:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:13:19,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:13:19,804 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:13:19,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:13:20,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:13:20,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:13:20,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:13:20,006 INFO L85 PathProgramCache]: Analyzing trace with hash -170504086, now seen corresponding path program 1 times [2025-03-17 05:13:20,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:13:20,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350109327] [2025-03-17 05:13:20,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:13:20,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:13:20,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:13:20,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:13:20,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:13:20,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:13:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 05:13:20,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:13:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350109327] [2025-03-17 05:13:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350109327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:13:20,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:13:20,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:13:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698696386] [2025-03-17 05:13:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:13:20,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:13:20,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:13:20,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:13:20,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:13:20,327 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 05:13:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:13:20,479 INFO L93 Difference]: Finished difference Result 188 states and 284 transitions. [2025-03-17 05:13:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:13:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 155 [2025-03-17 05:13:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:13:20,482 INFO L225 Difference]: With dead ends: 188 [2025-03-17 05:13:20,482 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 05:13:20,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:13:20,483 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 57 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:13:20,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 359 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:13:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 05:13:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2025-03-17 05:13:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:13:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 179 transitions. [2025-03-17 05:13:20,524 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 179 transitions. Word has length 155 [2025-03-17 05:13:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:13:20,524 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 179 transitions. [2025-03-17 05:13:20,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 05:13:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2025-03-17 05:13:20,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:13:20,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:13:20,527 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:13:20,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:13:20,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:13:20,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:13:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1572306249, now seen corresponding path program 1 times [2025-03-17 05:13:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:13:20,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355593092] [2025-03-17 05:13:20,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:13:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:13:20,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:13:20,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:13:20,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:13:20,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:13:20,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:13:20,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:13:20,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:13:20,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:13:20,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:13:20,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:13:20,759 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:13:20,760 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:13:20,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:13:20,763 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 05:13:20,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:13:20,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:13:20 BoogieIcfgContainer [2025-03-17 05:13:20,839 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:13:20,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:13:20,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:13:20,840 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:13:20,840 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:13:19" (3/4) ... [2025-03-17 05:13:20,842 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:13:20,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:13:20,843 INFO L158 Benchmark]: Toolchain (without parser) took 2195.24ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 119.1MB in the end (delta: 3.6MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2025-03-17 05:13:20,843 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:13:20,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.81ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 109.5MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:13:20,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.94ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 107.2MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:13:20,844 INFO L158 Benchmark]: Boogie Preprocessor took 41.84ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 105.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:13:20,844 INFO L158 Benchmark]: IcfgBuilder took 326.31ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 87.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:13:20,844 INFO L158 Benchmark]: TraceAbstraction took 1612.95ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 119.1MB in the end (delta: -31.7MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2025-03-17 05:13:20,844 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 119.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:13:20,845 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 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.81ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 109.5MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.94ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 107.2MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.84ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 105.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 326.31ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 87.9MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1612.95ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 119.1MB in the end (delta: -31.7MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 119.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 8.875; [L24] double var_1_3 = 63.5; [L25] double var_1_4 = 16.6; [L26] double var_1_5 = 127.8; [L27] unsigned char var_1_9 = 1; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 0; [L30] signed short int var_1_12 = -2; [L31] signed short int var_1_13 = 64; [L32] signed short int var_1_14 = 2; [L33] signed short int var_1_15 = 4; [L34] signed short int var_1_16 = 26204; [L35] signed short int var_1_17 = 5; [L36] signed long int var_1_18 = -5; [L37] signed long int var_1_19 = 100; [L38] signed long int var_1_20 = 0; [L39] signed long int var_1_21 = 128; [L40] signed long int last_1_var_1_18 = -5; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] last_1_var_1_18 = var_1_18 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L76] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_3=127/2, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L77] var_1_3 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L78] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_4=83/5, var_1_5=639/5, var_1_9=1] [L79] var_1_4 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_5=639/5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_5=639/5, var_1_9=1] [L80] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_5=639/5, var_1_9=1] [L81] var_1_5 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L82] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L83] var_1_9 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128] [L84] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128] [L85] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L85] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=0, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L86] var_1_10 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L87] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L88] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=0, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L89] var_1_11 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L90] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L91] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=64, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L92] var_1_13 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_13 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L93] RET assume_abort_if_not(var_1_13 >= -32767) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L94] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=2, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L95] var_1_14 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_14 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L96] RET assume_abort_if_not(var_1_14 >= -32767) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_14 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L97] RET assume_abort_if_not(var_1_14 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=4, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L98] var_1_15 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L99] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_15 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L100] RET assume_abort_if_not(var_1_15 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=26204, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L101] var_1_16 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L102] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L103] CALL assume_abort_if_not(var_1_16 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L103] RET assume_abort_if_not(var_1_16 <= 32766) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=5, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L104] var_1_17 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L105] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L106] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=100, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L107] var_1_19 = __VERIFIER_nondet_long() [L108] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L108] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L109] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=128, var_1_9=1] [L110] var_1_20 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=1] [L111] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_20 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=1] [L112] RET assume_abort_if_not(var_1_20 <= 536870911) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=128, var_1_9=1] [L113] var_1_21 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L114] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L129] RET updateVariables() [L130] CALL step() [L44] signed long int stepLocal_1 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_1=-5, var_1_10=1, var_1_11=-256, var_1_12=-2, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L45] COND FALSE !(stepLocal_1 >= 0) [L48] var_1_12 = ((((var_1_13) > ((var_1_15 - (var_1_16 - var_1_17)))) ? (var_1_13) : ((var_1_15 - (var_1_16 - var_1_17))))) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L50] signed long int stepLocal_3 = var_1_15 - var_1_19; [L51] signed short int stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_2=4, stepLocal_3=16387, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=-5, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L52] COND FALSE !(var_1_12 > stepLocal_3) [L57] var_1_18 = var_1_14 VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_2=4, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L59] signed long int stepLocal_0 = (((var_1_12) > (var_1_18)) ? (var_1_12) : (var_1_18)); VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_0=32766, stepLocal_2=4, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=1, var_1_20=536870911, var_1_21=0, var_1_9=1] [L60] COND FALSE !((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) [L71] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_18=-5, stepLocal_0=32766, stepLocal_2=4, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=536870911, var_1_21=0, var_1_9=1] [L130] RET step() [L131] CALL, EXPR property() [L121-L122] return ((((((((var_1_2 + var_1_3)) < ((var_1_4 - var_1_5))) ? ((var_1_2 + var_1_3)) : ((var_1_4 - var_1_5)))) != 31.9) ? ((((((var_1_12) > (var_1_18)) ? (var_1_12) : (var_1_18))) < var_1_18) ? (var_1_9 ? (var_1_1 == ((unsigned char) var_1_10)) : (var_1_1 == ((unsigned char) var_1_10))) : (var_1_1 == ((unsigned char) var_1_10))) : (var_1_1 == ((unsigned char) var_1_11))) && ((last_1_var_1_18 >= 0) ? (var_1_12 == ((signed short int) ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))))) : (var_1_12 == ((signed short int) ((((var_1_13) > ((var_1_15 - (var_1_16 - var_1_17)))) ? (var_1_13) : ((var_1_15 - (var_1_16 - var_1_17))))))))) && ((var_1_12 > (var_1_15 - var_1_19)) ? ((var_1_13 < var_1_12) ? (var_1_18 == ((signed long int) ((var_1_17 + (var_1_16 + var_1_20)) - var_1_21))) : 1) : (var_1_18 == ((signed long int) var_1_14))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=536870911, var_1_21=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=-5, var_1_10=1, var_1_11=-256, var_1_12=4, var_1_13=4, var_1_14=32766, var_1_15=16387, var_1_16=32766, var_1_17=16383, var_1_18=32766, var_1_19=0, var_1_1=-256, var_1_20=536870911, var_1_21=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 121 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 450 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 264 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 186 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3850/3900 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-17 05:13:20,861 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-50.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 a6ea67ec5141ba30c704987a9668199f8d55bb535d4080241ca9c1a7de14e100 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:13:22,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:13:22,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:13:22,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:13:22,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:13:22,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:13:22,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:13:22,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:13:22,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:13:22,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:13:22,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:13:22,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:13:22,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:13:22,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:13:22,822 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:13:22,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:13:22,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:13:22,822 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:13:22,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:13:22,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:13:22,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:13:22,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:13:22,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:13:22,824 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:13:22,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:13:22,824 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:13:22,824 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:13:22,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:13:22,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:13:22,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:13:22,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:13:22,824 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 -> a6ea67ec5141ba30c704987a9668199f8d55bb535d4080241ca9c1a7de14e100 [2025-03-17 05:13:23,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:13:23,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:13:23,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:13:23,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:13:23,086 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:13:23,087 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-50.i [2025-03-17 05:13:24,244 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873ad1c79/2c6382d5b74444bd8d1b1afb3b59ec72/FLAG6c305a568 [2025-03-17 05:13:24,470 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:13:24,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-50.i [2025-03-17 05:13:24,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873ad1c79/2c6382d5b74444bd8d1b1afb3b59ec72/FLAG6c305a568 [2025-03-17 05:13:24,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/873ad1c79/2c6382d5b74444bd8d1b1afb3b59ec72 [2025-03-17 05:13:24,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:13:24,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:13:24,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:13:24,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:13:24,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:13:24,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9e6dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24, skipping insertion in model container [2025-03-17 05:13:24,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:13:24,624 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-50.i[913,926] [2025-03-17 05:13:24,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:13:24,680 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:13:24,689 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-50.i[913,926] [2025-03-17 05:13:24,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:13:24,715 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:13:24,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24 WrapperNode [2025-03-17 05:13:24,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:13:24,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:13:24,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:13:24,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:13:24,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,753 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-03-17 05:13:24,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:13:24,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:13:24,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:13:24,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:13:24,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,785 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-17 05:13:24,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,794 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:13:24,801 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:13:24,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:13:24,802 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:13:24,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (1/1) ... [2025-03-17 05:13:24,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:13:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:13:24,836 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-17 05:13:24,839 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-17 05:13:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:13:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:13:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:13:24,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:13:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:13:24,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:13:24,920 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:13:24,922 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:13:27,066 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 05:13:27,066 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:13:27,072 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:13:27,073 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:13:27,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:13:27 BoogieIcfgContainer [2025-03-17 05:13:27,073 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:13:27,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:13:27,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:13:27,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:13:27,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:13:24" (1/3) ... [2025-03-17 05:13:27,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174b756c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:13:27, skipping insertion in model container [2025-03-17 05:13:27,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:13:24" (2/3) ... [2025-03-17 05:13:27,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174b756c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:13:27, skipping insertion in model container [2025-03-17 05:13:27,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:13:27" (3/3) ... [2025-03-17 05:13:27,080 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-50.i [2025-03-17 05:13:27,090 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:13:27,091 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-50.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:13:27,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:13:27,143 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;@58039f35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:13:27,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:13:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:13:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:13:27,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:13:27,157 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:13:27,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:13:27,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:13:27,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1289355142, now seen corresponding path program 1 times [2025-03-17 05:13:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:13:27,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199664171] [2025-03-17 05:13:27,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:13:27,169 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-17 05:13:27,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:13:27,171 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-17 05:13:27,172 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-17 05:13:27,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:13:27,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:13:27,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:13:27,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:13:27,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:13:27,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:13:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2025-03-17 05:13:27,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:13:27,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:13:27,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199664171] [2025-03-17 05:13:27,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199664171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:13:27,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:13:27,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:13:27,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776136202] [2025-03-17 05:13:27,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:13:27,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:13:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:13:27,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:13:27,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:13:27,525 INFO L87 Difference]: Start difference. First operand has 62 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:13:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:13:27,552 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2025-03-17 05:13:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:13:27,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 155 [2025-03-17 05:13:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:13:27,561 INFO L225 Difference]: With dead ends: 121 [2025-03-17 05:13:27,561 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 05:13:27,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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-17 05:13:27,568 INFO L435 NwaCegarLoop]: 91 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, 91 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-17 05:13:27,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:13:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 05:13:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 05:13:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:13:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2025-03-17 05:13:27,613 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 155 [2025-03-17 05:13:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:13:27,614 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2025-03-17 05:13:27,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-17 05:13:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2025-03-17 05:13:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:13:27,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:13:27,620 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:13:27,630 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-17 05:13:27,825 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-17 05:13:27,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:13:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:13:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash -170504086, now seen corresponding path program 1 times [2025-03-17 05:13:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:13:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990551235] [2025-03-17 05:13:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:13:27,827 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-17 05:13:27,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:13:27,829 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-17 05:13:27,831 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-17 05:13:27,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:13:28,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:13:28,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:13:28,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:13:28,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:13:28,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:13:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-17 05:13:28,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:13:28,727 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:13:28,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990551235] [2025-03-17 05:13:28,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990551235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:13:28,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:13:28,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:13:28,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778458888] [2025-03-17 05:13:28,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:13:28,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:13:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:13:28,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:13:28,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:13:28,731 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 05:13:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:13:30,904 INFO L93 Difference]: Finished difference Result 188 states and 284 transitions. [2025-03-17 05:13:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:13:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 155 [2025-03-17 05:13:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:13:30,922 INFO L225 Difference]: With dead ends: 188 [2025-03-17 05:13:30,922 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 05:13:30,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:13:30,923 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 54 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:13:30,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 359 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 05:13:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 05:13:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2025-03-17 05:13:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:13:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 179 transitions. [2025-03-17 05:13:30,963 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 179 transitions. Word has length 155 [2025-03-17 05:13:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:13:30,964 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 179 transitions. [2025-03-17 05:13:30,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-17 05:13:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2025-03-17 05:13:30,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 05:13:30,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:13:30,968 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:13:30,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:13:31,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-17 05:13:31,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:13:31,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:13:31,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1572306249, now seen corresponding path program 1 times [2025-03-17 05:13:31,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:13:31,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739820508] [2025-03-17 05:13:31,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:13:31,170 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-17 05:13:31,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:13:31,172 INFO L229 MonitoredProcess]: Starting monitored process 4 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-17 05:13:31,173 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 (4)] Waiting until timeout for monitored process [2025-03-17 05:13:31,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 05:13:31,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 05:13:31,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:13:31,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:13:31,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:13:31,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:14:02,792 WARN L286 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)