./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.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 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:52:38,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:52:39,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:52:39,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:52:39,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:52:39,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:52:39,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:52:39,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:52:39,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:52:39,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:52:39,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:52:39,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:52:39,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:52:39,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:52:39,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:52:39,071 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:52:39,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:39,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:52:39,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:52:39,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:52:39,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:52:39,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:52:39,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:52:39,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:52:39,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:52:39,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:52:39,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:52:39,072 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 -> 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 [2025-03-04 00:52:39,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:52:39,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:52:39,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:52:39,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:52:39,305 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:52:39,306 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-3.i [2025-03-04 00:52:40,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff69889d/c257dd18ba2f480ea6befc3df3370c95/FLAGbaa5180a4 [2025-03-04 00:52:40,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:52:40,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i [2025-03-04 00:52:40,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff69889d/c257dd18ba2f480ea6befc3df3370c95/FLAGbaa5180a4 [2025-03-04 00:52:40,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff69889d/c257dd18ba2f480ea6befc3df3370c95 [2025-03-04 00:52:40,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:52:40,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:52:40,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:40,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:52:40,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:52:40,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:40,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40, skipping insertion in model container [2025-03-04 00:52:40,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:40,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:52:40,845 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-3.i[912,925] [2025-03-04 00:52:40,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:40,902 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:52:40,910 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-3.i[912,925] [2025-03-04 00:52:40,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:40,946 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:52:40,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40 WrapperNode [2025-03-04 00:52:40,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:40,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:40,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:52:40,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:52:40,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:40,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:40,986 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-03-04 00:52:40,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:40,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:52:40,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:52:40,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:52:40,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:40,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:41,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:41,010 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:52:41,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:41,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:41,019 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:41,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:41,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:41,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:41,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:52:41,024 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:52:41,024 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:52:41,024 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:52:41,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (1/1) ... [2025-03-04 00:52:41,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:41,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:41,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:52:41,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:52:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:52:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:52:41,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:52:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:52:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:52:41,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:52:41,120 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:52:41,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:52:41,275 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 00:52:41,275 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:52:41,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:52:41,284 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:52:41,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:41 BoogieIcfgContainer [2025-03-04 00:52:41,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:52:41,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:52:41,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:52:41,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:52:41,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:52:40" (1/3) ... [2025-03-04 00:52:41,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9fc022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:41, skipping insertion in model container [2025-03-04 00:52:41,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:40" (2/3) ... [2025-03-04 00:52:41,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9fc022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:41, skipping insertion in model container [2025-03-04 00:52:41,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:41" (3/3) ... [2025-03-04 00:52:41,291 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-3.i [2025-03-04 00:52:41,300 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:52:41,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-3.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:52:41,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:52:41,356 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;@20b61ded, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:52:41,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:52:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 00:52:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 00:52:41,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:41,370 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:41,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:41,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:41,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1341036285, now seen corresponding path program 1 times [2025-03-04 00:52:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878578016] [2025-03-04 00:52:41,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:41,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:41,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:41,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:41,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:41,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 00:52:41,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:52:41,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878578016] [2025-03-04 00:52:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878578016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:52:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268577513] [2025-03-04 00:52:41,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:41,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:52:41,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:41,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:52:41,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:52:41,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:41,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:41,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:41,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:41,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:52:41,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 00:52:41,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:52:41,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268577513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:52:41,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:52:41,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:52:41,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631532765] [2025-03-04 00:52:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:52:41,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:52:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:52:41,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:52:41,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:41,753 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 00:52:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:41,773 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2025-03-04 00:52:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:52:41,774 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2025-03-04 00:52:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:41,778 INFO L225 Difference]: With dead ends: 96 [2025-03-04 00:52:41,779 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 00:52:41,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:41,783 INFO L435 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:52:41,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:52:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 00:52:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 00:52:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 00:52:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-04 00:52:41,808 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 104 [2025-03-04 00:52:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:41,808 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-04 00:52:41,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 00:52:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-04 00:52:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 00:52:41,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:41,810 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:41,816 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-04 00:52:42,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:52:42,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:42,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 940046983, now seen corresponding path program 1 times [2025-03-04 00:52:42,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:42,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-03-04 00:52:42,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:42,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:42,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:42,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:42,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 00:52:42,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:52:42,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979352228] [2025-03-04 00:52:42,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979352228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:52:42,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:52:42,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:52:42,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291153726] [2025-03-04 00:52:42,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:52:42,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:52:42,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:52:42,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:52:42,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:52:42,347 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 00:52:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:42,375 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2025-03-04 00:52:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:52:42,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-03-04 00:52:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:42,378 INFO L225 Difference]: With dead ends: 138 [2025-03-04 00:52:42,379 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 00:52:42,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:52:42,381 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:52:42,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:52:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 00:52:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-03-04 00:52:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 00:52:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-04 00:52:42,398 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 104 [2025-03-04 00:52:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:42,398 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-04 00:52:42,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 00:52:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-04 00:52:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 00:52:42,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:42,399 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:42,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:52:42,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:42,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:42,400 INFO L85 PathProgramCache]: Analyzing trace with hash 968676134, now seen corresponding path program 1 times [2025-03-04 00:52:42,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:42,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031724650] [2025-03-04 00:52:42,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:42,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:42,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:42,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:42,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 00:52:42,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:52:42,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031724650] [2025-03-04 00:52:42,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031724650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:52:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329116444] [2025-03-04 00:52:42,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:42,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:52:42,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:42,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:52:42,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:52:42,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:42,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:42,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:42,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:42,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:52:42,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-04 00:52:42,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:52:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 00:52:43,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329116444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:52:43,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:52:43,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:52:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213523823] [2025-03-04 00:52:43,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:52:43,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:52:43,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:52:43,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:52:43,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:52:43,137 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 00:52:43,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:43,265 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2025-03-04 00:52:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:52:43,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 104 [2025-03-04 00:52:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:43,268 INFO L225 Difference]: With dead ends: 193 [2025-03-04 00:52:43,268 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 00:52:43,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:52:43,271 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:52:43,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 110 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:52:43,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 00:52:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2025-03-04 00:52:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 00:52:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2025-03-04 00:52:43,290 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 104 [2025-03-04 00:52:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:43,290 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2025-03-04 00:52:43,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 00:52:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2025-03-04 00:52:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 00:52:43,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:43,293 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:43,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:52:43,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 00:52:43,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash 969599655, now seen corresponding path program 1 times [2025-03-04 00:52:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690612780] [2025-03-04 00:52:43,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:43,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:43,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:43,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:43,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:43,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:52:43,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:52:43,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:43,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:43,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:43,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:52:43,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:52:43,621 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:52:43,622 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:52:43,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:52:43,627 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 00:52:43,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:52:43,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:52:43 BoogieIcfgContainer [2025-03-04 00:52:43,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:52:43,696 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:52:43,696 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:52:43,696 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:52:43,696 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:41" (3/4) ... [2025-03-04 00:52:43,698 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:52:43,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:52:43,699 INFO L158 Benchmark]: Toolchain (without parser) took 2976.10ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 58.6MB in the end (delta: 74.7MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2025-03-04 00:52:43,699 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory was 125.6MB in the beginning and 125.3MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:43,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.18ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 120.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:52:43,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.36ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 118.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:52:43,701 INFO L158 Benchmark]: Boogie Preprocessor took 32.77ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 116.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:43,701 INFO L158 Benchmark]: IcfgBuilder took 260.93ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 100.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:52:43,701 INFO L158 Benchmark]: TraceAbstraction took 2408.13ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 58.6MB in the end (delta: 41.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2025-03-04 00:52:43,701 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 167.8MB. Free memory was 58.6MB in the beginning and 58.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:43,702 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.27ms. Allocated memory is still 201.3MB. Free memory was 125.6MB in the beginning and 125.3MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.18ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 120.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.36ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 118.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.77ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 116.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 260.93ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 100.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2408.13ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 58.6MB in the end (delta: 41.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 167.8MB. Free memory was 58.6MB in the beginning and 58.6MB 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 someUnaryDOUBLEoperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 127.5; [L32] double var_1_13 = 15.75; [L33] double var_1_14 = -0.5; [L34] double var_1_15 = 5.25; [L35] double var_1_16 = 8.5; [L36] unsigned char last_1_var_1_11 = 1; VAL [isInitial=0, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L69] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L69] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L72] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L72] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L74] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L75] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L75] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=500, var_1_9=-5] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L77] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L78] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L78] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=-5] [L79] var_1_9 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L80] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L81] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L81] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L83] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L84] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L84] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_13=63/4, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L85] var_1_13 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L86] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L87] var_1_14 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L88] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_15=21/4, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L89] var_1_15 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L90] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_16=17/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L91] var_1_16 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L92] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L106] RET updateVariables() [L107] CALL step() [L40] unsigned char stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L41] COND FALSE !(! last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L46] signed long int stepLocal_2 = var_1_7; [L47] signed long int stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, stepLocal_2=1073741822, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L48] COND FALSE !(var_1_8 <= stepLocal_2) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L55] COND FALSE !(! var_1_11) [L58] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=255/2, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L60] COND FALSE !(\read(var_1_4)) [L63] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_11=1, stepLocal_0=1, stepLocal_1=-536870911, var_1_10=-536870911, var_1_11=1, var_1_12=1073741828, var_1_15=1073741828, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((! last_1_var_1_11) ? ((last_1_var_1_11 && last_1_var_1_11) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_11) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_1 || (! var_1_5))))) : 1)) && (var_1_4 ? (var_1_12 == ((double) (((((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) < ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))))))) ? ((((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14))) + var_1_15)) : ((((((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) < 0 ) ? -((((3.5) < (var_1_16)) ? (3.5) : (var_1_16))) : ((((3.5) < (var_1_16)) ? (3.5) : (var_1_16)))))))))) : (var_1_12 == ((double) var_1_15))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=1073741828, var_1_15=1073741828, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=1073741828, var_1_15=1073741828, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=1, var_1_10=-536870911, var_1_11=1, var_1_12=1073741828, var_1_15=1073741828, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1073741822, var_1_8=1073741823, var_1_9=536870912] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 183 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 618 ConstructedInterpolants, 0 QuantifiedInterpolants, 1304 SizeOfPredicates, 1 NumberOfNonLiveVariables, 483 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2724/2880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:52:43,720 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-3.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 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:52:45,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:52:45,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:52:45,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:52:45,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:52:45,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:52:45,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:52:45,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:52:45,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:52:45,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:52:45,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:52:45,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:52:45,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:52:45,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:52:45,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:52:45,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:52:45,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:52:45,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:52:45,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:52:45,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:52:45,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:52:45,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:52:45,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:52:45,672 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:52:45,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:45,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:52:45,673 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:52:45,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:52:45,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:52:45,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:52:45,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:52:45,674 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 -> 11631ade7f4802c0df912c1c8c774ea3be3e8c755291fcf699ca7b6debf1cc73 [2025-03-04 00:52:45,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:52:45,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:52:45,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:52:45,923 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:52:45,923 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:52:45,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-3.i [2025-03-04 00:52:47,119 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3832d62ff/a965efb47aae403c80978355ac46aa82/FLAG6ff87fa3f [2025-03-04 00:52:47,326 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:52:47,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-3.i [2025-03-04 00:52:47,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3832d62ff/a965efb47aae403c80978355ac46aa82/FLAG6ff87fa3f [2025-03-04 00:52:47,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3832d62ff/a965efb47aae403c80978355ac46aa82 [2025-03-04 00:52:47,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:52:47,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:52:47,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:47,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:52:47,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:52:47,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198bf93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47, skipping insertion in model container [2025-03-04 00:52:47,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:52:47,472 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-3.i[912,925] [2025-03-04 00:52:47,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:47,517 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:52:47,524 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-3.i[912,925] [2025-03-04 00:52:47,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:47,553 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:52:47,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47 WrapperNode [2025-03-04 00:52:47,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:47,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:47,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:52:47,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:52:47,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,589 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-04 00:52:47,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:47,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:52:47,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:52:47,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:52:47,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,627 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:52:47,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:52:47,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:52:47,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:52:47,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:52:47,653 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (1/1) ... [2025-03-04 00:52:47,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:47,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:47,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:52:47,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:52:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:52:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:52:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:52:47,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:52:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:52:47,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:52:47,745 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:52:47,746 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:52:48,153 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 00:52:48,153 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:52:48,163 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:52:48,163 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:52:48,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:48 BoogieIcfgContainer [2025-03-04 00:52:48,164 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:52:48,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:52:48,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:52:48,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:52:48,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:52:47" (1/3) ... [2025-03-04 00:52:48,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cbc3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:48, skipping insertion in model container [2025-03-04 00:52:48,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:47" (2/3) ... [2025-03-04 00:52:48,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cbc3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:48, skipping insertion in model container [2025-03-04 00:52:48,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:48" (3/3) ... [2025-03-04 00:52:48,171 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-3.i [2025-03-04 00:52:48,181 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:52:48,182 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-3.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:52:48,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:52:48,237 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;@8f8a6af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:52:48,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:52:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 00:52:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 00:52:48,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:48,248 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:48,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:48,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1341036285, now seen corresponding path program 1 times [2025-03-04 00:52:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:48,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878108018] [2025-03-04 00:52:48,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:48,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:52:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:48,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:52:48,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:52:48,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:48,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:48,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:48,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:48,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:52:48,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-04 00:52:48,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:52:48,486 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:52:48,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878108018] [2025-03-04 00:52:48,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878108018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:52:48,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:52:48,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:52:48,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270833506] [2025-03-04 00:52:48,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:52:48,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:52:48,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:52:48,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:52:48,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:48,508 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 00:52:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:48,530 INFO L93 Difference]: Finished difference Result 96 states and 159 transitions. [2025-03-04 00:52:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:52:48,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2025-03-04 00:52:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:48,536 INFO L225 Difference]: With dead ends: 96 [2025-03-04 00:52:48,537 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 00:52:48,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:48,542 INFO L435 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:52:48,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:52:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 00:52:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 00:52:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 00:52:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-04 00:52:48,576 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 104 [2025-03-04 00:52:48,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:48,576 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-04 00:52:48,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 00:52:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-04 00:52:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 00:52:48,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:48,581 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:48,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:52:48,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:52:48,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:48,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash 940046983, now seen corresponding path program 1 times [2025-03-04 00:52:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:48,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050034711] [2025-03-04 00:52:48,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:48,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:52:48,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:48,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:52:48,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:52:48,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:48,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:48,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:48,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:48,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:52:48,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 00:52:49,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:52:49,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:52:49,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050034711] [2025-03-04 00:52:49,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050034711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:52:49,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:52:49,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:52:49,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597796163] [2025-03-04 00:52:49,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:52:49,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:52:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:52:49,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:52:49,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:52:49,175 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 00:52:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:49,434 INFO L93 Difference]: Finished difference Result 138 states and 201 transitions. [2025-03-04 00:52:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:52:49,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2025-03-04 00:52:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:49,437 INFO L225 Difference]: With dead ends: 138 [2025-03-04 00:52:49,437 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 00:52:49,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:52:49,438 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:52:49,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:52:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 00:52:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-03-04 00:52:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 00:52:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2025-03-04 00:52:49,451 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 104 [2025-03-04 00:52:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:49,452 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2025-03-04 00:52:49,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 00:52:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2025-03-04 00:52:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 00:52:49,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:49,453 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:49,460 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-04 00:52:49,657 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-04 00:52:49,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:49,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:49,658 INFO L85 PathProgramCache]: Analyzing trace with hash 968676134, now seen corresponding path program 1 times [2025-03-04 00:52:49,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:49,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103458118] [2025-03-04 00:52:49,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:49,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:52:49,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:49,660 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-04 00:52:49,661 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-04 00:52:49,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:49,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:49,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:49,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:49,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 00:52:49,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-04 00:52:49,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:52:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 00:52:50,158 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:52:50,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103458118] [2025-03-04 00:52:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103458118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:52:50,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:52:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-04 00:52:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906161081] [2025-03-04 00:52:50,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:52:50,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:52:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:52:50,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:52:50,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:52:50,161 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 00:52:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:50,512 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2025-03-04 00:52:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:52:50,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 104 [2025-03-04 00:52:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:50,522 INFO L225 Difference]: With dead ends: 193 [2025-03-04 00:52:50,522 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 00:52:50,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:52:50,524 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:52:50,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 110 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:52:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 00:52:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2025-03-04 00:52:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 00:52:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2025-03-04 00:52:50,534 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 104 [2025-03-04 00:52:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:50,535 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2025-03-04 00:52:50,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 00:52:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2025-03-04 00:52:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 00:52:50,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:50,536 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:52:50,542 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 (4)] Ended with exit code 0 [2025-03-04 00:52:50,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:52:50,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:50,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 969599655, now seen corresponding path program 1 times [2025-03-04 00:52:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:50,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529570925] [2025-03-04 00:52:50,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:50,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:52:50,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:50,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:52:50,745 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 (5)] Waiting until timeout for monitored process [2025-03-04 00:52:50,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 00:52:50,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 00:52:50,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:50,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:50,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:52:50,894 INFO L279 TraceCheckSpWp]: Computing forward predicates...