./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.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-64.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 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:57:04,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:57:05,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:57:05,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:57:05,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:57:05,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:57:05,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:57:05,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:57:05,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:57:05,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:57:05,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:57:05,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:57:05,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:57:05,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:57:05,071 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:57:05,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:57:05,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:57:05,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:57:05,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:57:05,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:57:05,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:57:05,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:57:05,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:57:05,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:57:05,072 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:57:05,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:57:05,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:57:05,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:57:05,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:57:05,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:57:05,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:57:05,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:57:05,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:57:05,073 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 -> 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 [2025-03-04 00:57:05,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:57:05,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:57:05,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:57:05,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:57:05,306 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:57:05,307 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-64.i [2025-03-04 00:57:06,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e0dfca3/ebc39c2a243543fbab488f3096609618/FLAG49df252ac [2025-03-04 00:57:06,724 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:57:06,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i [2025-03-04 00:57:06,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e0dfca3/ebc39c2a243543fbab488f3096609618/FLAG49df252ac [2025-03-04 00:57:07,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e0dfca3/ebc39c2a243543fbab488f3096609618 [2025-03-04 00:57:07,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:57:07,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:57:07,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:57:07,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:57:07,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:57:07,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c93915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07, skipping insertion in model container [2025-03-04 00:57:07,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:57:07,135 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-64.i[913,926] [2025-03-04 00:57:07,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:57:07,175 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:57:07,184 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-64.i[913,926] [2025-03-04 00:57:07,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:57:07,218 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:57:07,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07 WrapperNode [2025-03-04 00:57:07,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:57:07,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:57:07,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:57:07,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:57:07,223 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:57:07" (1/1) ... [2025-03-04 00:57:07,228 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:57:07" (1/1) ... [2025-03-04 00:57:07,244 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-03-04 00:57:07,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:57:07,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:57:07,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:57:07,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:57:07,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,261 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:57:07,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:57:07,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:57:07,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:57:07,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:57:07,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (1/1) ... [2025-03-04 00:57:07,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:57:07,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:07,304 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:57:07,309 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:57:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:57:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:57:07,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:57:07,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:57:07,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:57:07,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:57:07,381 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:57:07,382 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:57:07,597 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~bitwise16#1;havoc property_#t~short17#1; [2025-03-04 00:57:07,619 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-04 00:57:07,619 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:57:07,631 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:57:07,631 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:57:07,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:07 BoogieIcfgContainer [2025-03-04 00:57:07,632 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:57:07,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:57:07,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:57:07,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:57:07,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:57:07" (1/3) ... [2025-03-04 00:57:07,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c48a0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:57:07, skipping insertion in model container [2025-03-04 00:57:07,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:07" (2/3) ... [2025-03-04 00:57:07,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c48a0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:57:07, skipping insertion in model container [2025-03-04 00:57:07,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:07" (3/3) ... [2025-03-04 00:57:07,639 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-64.i [2025-03-04 00:57:07,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:57:07,650 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-64.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:57:07,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:57:07,703 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;@24e35682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:57:07,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:57:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:57:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 00:57:07,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:07,718 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:07,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:07,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1961734652, now seen corresponding path program 1 times [2025-03-04 00:57:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:07,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147090472] [2025-03-04 00:57:07,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:07,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 00:57:07,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 00:57:07,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:07,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 00:57:07,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:57:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147090472] [2025-03-04 00:57:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147090472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:57:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806508095] [2025-03-04 00:57:07,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:07,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:57:07,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:07,921 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:57:07,922 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:57:07,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 00:57:08,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 00:57:08,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:08,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:08,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:57:08,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:57:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 00:57:08,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:57:08,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806508095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:08,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:57:08,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:57:08,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181832508] [2025-03-04 00:57:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:08,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:57:08,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:57:08,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:57:08,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:57:08,090 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:57:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:08,110 INFO L93 Difference]: Finished difference Result 128 states and 217 transitions. [2025-03-04 00:57:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:57:08,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2025-03-04 00:57:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:08,117 INFO L225 Difference]: With dead ends: 128 [2025-03-04 00:57:08,117 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 00:57:08,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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:57:08,121 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:08,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:57:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 00:57:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 00:57:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:57:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2025-03-04 00:57:08,147 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 128 [2025-03-04 00:57:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:08,147 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2025-03-04 00:57:08,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:57:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2025-03-04 00:57:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 00:57:08,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:08,149 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:08,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:57:08,349 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:57:08,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:08,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1851805334, now seen corresponding path program 1 times [2025-03-04 00:57:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:08,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60109053] [2025-03-04 00:57:08,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:08,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 00:57:08,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 00:57:08,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:08,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 00:57:09,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:57:09,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60109053] [2025-03-04 00:57:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60109053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:09,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:57:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102547396] [2025-03-04 00:57:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:09,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:57:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:57:09,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:57:09,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:57:09,493 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 00:57:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:10,092 INFO L93 Difference]: Finished difference Result 244 states and 363 transitions. [2025-03-04 00:57:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:57:10,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2025-03-04 00:57:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:10,095 INFO L225 Difference]: With dead ends: 244 [2025-03-04 00:57:10,096 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 00:57:10,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:57:10,098 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 224 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:10,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 530 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:57:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 00:57:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2025-03-04 00:57:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 00:57:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2025-03-04 00:57:10,128 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 128 [2025-03-04 00:57:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:10,128 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2025-03-04 00:57:10,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 00:57:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2025-03-04 00:57:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 00:57:10,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:10,131 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:10,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:57:10,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:10,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash 646210603, now seen corresponding path program 1 times [2025-03-04 00:57:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:10,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192827654] [2025-03-04 00:57:10,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:10,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:10,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 00:57:10,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 00:57:10,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:10,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-04 00:57:10,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:57:10,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192827654] [2025-03-04 00:57:10,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192827654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:57:10,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227491999] [2025-03-04 00:57:10,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:10,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:57:10,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:10,562 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:57:10,563 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:57:10,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 00:57:10,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 00:57:10,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:10,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:10,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:57:10,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:57:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 429 proven. 39 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-04 00:57:12,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:57:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 69 proven. 42 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-04 00:57:14,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227491999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:57:14,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:57:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 27 [2025-03-04 00:57:14,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807123220] [2025-03-04 00:57:14,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:57:14,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 00:57:14,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:57:14,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 00:57:14,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:57:14,148 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2025-03-04 00:57:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:15,335 INFO L93 Difference]: Finished difference Result 245 states and 349 transitions. [2025-03-04 00:57:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 00:57:15,336 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 128 [2025-03-04 00:57:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:15,338 INFO L225 Difference]: With dead ends: 245 [2025-03-04 00:57:15,339 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 00:57:15,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=600, Invalid=2156, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 00:57:15,343 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 595 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:15,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 742 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:57:15,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 00:57:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 131. [2025-03-04 00:57:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.180722891566265) internal successors, (98), 83 states have internal predecessors, (98), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 00:57:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2025-03-04 00:57:15,366 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 128 [2025-03-04 00:57:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:15,367 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2025-03-04 00:57:15,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2025-03-04 00:57:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2025-03-04 00:57:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 00:57:15,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:15,368 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:15,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:57:15,571 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:57:15,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:15,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:15,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2050625285, now seen corresponding path program 1 times [2025-03-04 00:57:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:15,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195012615] [2025-03-04 00:57:15,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:15,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:15,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 00:57:15,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 00:57:15,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:15,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:57:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [183955018] [2025-03-04 00:57:15,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:15,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:57:15,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:15,629 INFO L229 MonitoredProcess]: Starting monitored process 4 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:57:15,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:57:15,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 00:57:15,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 00:57:15,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:15,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:57:15,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:57:15,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 00:57:15,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 00:57:15,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:15,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:57:15,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:57:15,813 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:57:15,813 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:57:15,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:57:16,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:57:16,021 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 00:57:16,083 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:57:16,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:57:16 BoogieIcfgContainer [2025-03-04 00:57:16,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:57:16,088 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:57:16,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:57:16,088 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:57:16,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:07" (3/4) ... [2025-03-04 00:57:16,090 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:57:16,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:57:16,091 INFO L158 Benchmark]: Toolchain (without parser) took 9059.64ms. Allocated memory was 201.3MB in the beginning and 654.3MB in the end (delta: 453.0MB). Free memory was 155.2MB in the beginning and 514.4MB in the end (delta: -359.2MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2025-03-04 00:57:16,091 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:57:16,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.36ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 141.9MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:57:16,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.18ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 139.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:57:16,092 INFO L158 Benchmark]: Boogie Preprocessor took 27.77ms. Allocated memory is still 201.3MB. Free memory was 139.6MB in the beginning and 137.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:57:16,092 INFO L158 Benchmark]: IcfgBuilder took 358.45ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 115.7MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 00:57:16,092 INFO L158 Benchmark]: TraceAbstraction took 8453.78ms. Allocated memory was 201.3MB in the beginning and 654.3MB in the end (delta: 453.0MB). Free memory was 115.3MB in the beginning and 514.6MB in the end (delta: -399.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 00:57:16,092 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 654.3MB. Free memory was 514.6MB in the beginning and 514.4MB in the end (delta: 207.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:57:16,093 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.20ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.36ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 141.9MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.18ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 139.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.77ms. Allocated memory is still 201.3MB. Free memory was 139.6MB in the beginning and 137.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 358.45ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 115.7MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8453.78ms. Allocated memory was 201.3MB in the beginning and 654.3MB in the end (delta: 453.0MB). Free memory was 115.3MB in the beginning and 514.6MB in the end (delta: -399.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 654.3MB. Free memory was 514.6MB in the beginning and 514.4MB in the end (delta: 207.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.9; [L23] unsigned long int var_1_2 = 128; [L24] unsigned long int var_1_3 = 2941876006; [L25] unsigned long int var_1_5 = 256; [L26] float var_1_6 = 63.5; [L27] float var_1_7 = -0.151; [L28] float var_1_8 = 0.8; [L29] double var_1_9 = 9.5; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] unsigned char var_1_12 = 0; [L33] signed short int var_1_13 = -2; [L34] unsigned char var_1_16 = 10; [L35] unsigned short int var_1_17 = 8; [L36] unsigned char var_1_18 = 16; [L37] unsigned char last_1_var_1_16 = 10; VAL [isInitial=0, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_2=128, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L105] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_2=128, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L75] var_1_3 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L78] var_1_5 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L79] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L80] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L80] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L81] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L81] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L82] var_1_6 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L84] var_1_7 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_8=4/5, var_1_9=19/2] [L86] var_1_8 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_9=19/2] [L87] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10, var_1_9=19/2] [L88] var_1_9 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L91] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L92] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L92] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L93] var_1_12 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L94] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L95] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L95] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L96] var_1_17 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L98] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L98] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L99] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L99] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L102] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L102] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L116] RET updateVariables() [L117] CALL step() [L41] signed long int stepLocal_1 = last_1_var_1_16; [L42] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_16=10, stepLocal_0=2147483647, stepLocal_1=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L43] COND TRUE stepLocal_1 <= (var_1_3 - last_1_var_1_16) VAL [isInitial=1, last_1_var_1_16=10, stepLocal_0=2147483647, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=10] [L44] COND FALSE !(stepLocal_0 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) [L49] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=2, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L52] COND TRUE var_1_1 < var_1_1 [L53] var_1_10 = (! (var_1_11 && var_1_12)) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=2, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L55] EXPR var_1_2 & (var_1_5 / var_1_17) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L55] unsigned long int stepLocal_2 = var_1_2 & (var_1_5 / var_1_17); [L56] COND FALSE !(stepLocal_2 > var_1_3) [L63] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L65] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR ((((last_1_var_1_16 <= (var_1_3 - last_1_var_1_16)) ? ((var_1_3 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) ? (((var_1_6 + var_1_7) > var_1_8) ? (var_1_1 == ((double) var_1_9)) : 1) : (var_1_1 == ((double) var_1_9))) : 1) && ((var_1_1 < var_1_1) ? (var_1_10 == ((unsigned char) (! (var_1_11 && var_1_12)))) : 1)) && (var_1_10 ? ((var_1_12 || (var_1_1 < (var_1_1 * var_1_1))) ? (var_1_13 == ((signed short int) (var_1_16 + var_1_16))) : 1) : 1)) && (((var_1_2 & (var_1_5 / var_1_17)) > var_1_3) ? ((! var_1_10) ? (var_1_16 == ((unsigned char) var_1_18)) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_18))) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L108-L109] return ((((last_1_var_1_16 <= (var_1_3 - last_1_var_1_16)) ? ((var_1_3 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) ? (((var_1_6 + var_1_7) > var_1_8) ? (var_1_1 == ((double) var_1_9)) : 1) : (var_1_1 == ((double) var_1_9))) : 1) && ((var_1_1 < var_1_1) ? (var_1_10 == ((unsigned char) (! (var_1_11 && var_1_12)))) : 1)) && (var_1_10 ? ((var_1_12 || (var_1_1 < (var_1_1 * var_1_1))) ? (var_1_13 == ((signed short int) (var_1_16 + var_1_16))) : 1) : 1)) && (((var_1_2 & (var_1_5 / var_1_17)) > var_1_3) ? ((! var_1_10) ? (var_1_16 == ((unsigned char) var_1_18)) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_18))) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=11, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=10, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 830 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 819 mSDsluCounter, 1366 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1077 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1246 IncrementalHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 289 mSDtfsCounter, 1246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=3, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 112 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 898 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 762 ConstructedInterpolants, 0 QuantifiedInterpolants, 3185 SizeOfPredicates, 10 NumberOfNonLiveVariables, 562 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4390/4560 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:57:16,115 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-64.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 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:57:17,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:57:18,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:57:18,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:57:18,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:57:18,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:57:18,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:57:18,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:57:18,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:57:18,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:57:18,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:57:18,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:57:18,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:57:18,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:57:18,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:57:18,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:57:18,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:57:18,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:57:18,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:57:18,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:57:18,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:57:18,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:57:18,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:57:18,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:57:18,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:57:18,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:57:18,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:57:18,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:57:18,052 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:57:18,052 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:57:18,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:57:18,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:57:18,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:57:18,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:57:18,053 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 -> 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 [2025-03-04 00:57:18,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:57:18,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:57:18,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:57:18,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:57:18,270 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:57:18,273 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-64.i [2025-03-04 00:57:19,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbab7f68/54388b458b434e8db63ea9347b0e2564/FLAGa10e2d7da [2025-03-04 00:57:19,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:57:19,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i [2025-03-04 00:57:19,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbab7f68/54388b458b434e8db63ea9347b0e2564/FLAGa10e2d7da [2025-03-04 00:57:20,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbab7f68/54388b458b434e8db63ea9347b0e2564 [2025-03-04 00:57:20,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:57:20,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:57:20,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:57:20,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:57:20,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:57:20,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718f4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20, skipping insertion in model container [2025-03-04 00:57:20,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:57:20,126 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-64.i[913,926] [2025-03-04 00:57:20,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:57:20,159 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:57:20,166 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-64.i[913,926] [2025-03-04 00:57:20,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:57:20,192 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:57:20,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20 WrapperNode [2025-03-04 00:57:20,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:57:20,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:57:20,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:57:20,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:57:20,199 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:57:20" (1/1) ... [2025-03-04 00:57:20,208 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:57:20" (1/1) ... [2025-03-04 00:57:20,232 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-03-04 00:57:20,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:57:20,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:57:20,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:57:20,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:57:20,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,257 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:57:20,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:57:20,282 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:57:20,282 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:57:20,282 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:57:20,283 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (1/1) ... [2025-03-04 00:57:20,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:57:20,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:20,309 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:57:20,315 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:57:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:57:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:57:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:57:20,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:57:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:57:20,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:57:20,395 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:57:20,396 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:57:21,608 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 00:57:21,609 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:57:21,614 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:57:21,615 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:57:21,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:21 BoogieIcfgContainer [2025-03-04 00:57:21,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:57:21,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:57:21,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:57:21,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:57:21,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:57:20" (1/3) ... [2025-03-04 00:57:21,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59460a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:57:21, skipping insertion in model container [2025-03-04 00:57:21,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:20" (2/3) ... [2025-03-04 00:57:21,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59460a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:57:21, skipping insertion in model container [2025-03-04 00:57:21,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:21" (3/3) ... [2025-03-04 00:57:21,621 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-64.i [2025-03-04 00:57:21,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:57:21,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-64.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:57:21,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:57:21,671 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;@32bf86ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:57:21,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:57:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:57:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 00:57:21,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:21,689 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:21,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:21,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2535233, now seen corresponding path program 1 times [2025-03-04 00:57:21,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:57:21,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969618436] [2025-03-04 00:57:21,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:21,708 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:57:21,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:57:21,710 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:57:21,712 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:57:21,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 00:57:22,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 00:57:22,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:22,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:22,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:57:22,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:57:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-04 00:57:22,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:57:22,115 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:57:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969618436] [2025-03-04 00:57:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969618436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:22,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:22,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:57:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527338037] [2025-03-04 00:57:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:22,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:57:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:57:22,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:57:22,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:57:22,161 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:57:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:22,177 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2025-03-04 00:57:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:57:22,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-03-04 00:57:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:22,186 INFO L225 Difference]: With dead ends: 110 [2025-03-04 00:57:22,187 INFO L226 Difference]: Without dead ends: 55 [2025-03-04 00:57:22,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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:57:22,191 INFO L435 NwaCegarLoop]: 81 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, 81 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:57:22,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:57:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-04 00:57:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-04 00:57:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:57:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-03-04 00:57:22,222 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 125 [2025-03-04 00:57:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:22,222 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-03-04 00:57:22,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:57:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-03-04 00:57:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 00:57:22,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:22,225 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:22,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:57:22,425 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:57:22,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:22,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:22,427 INFO L85 PathProgramCache]: Analyzing trace with hash -830102918, now seen corresponding path program 1 times [2025-03-04 00:57:22,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:57:22,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445913900] [2025-03-04 00:57:22,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:22,427 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:57:22,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:57:22,429 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:57:22,430 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:57:22,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 00:57:22,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 00:57:22,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:22,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:22,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:57:22,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:57:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 00:57:40,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:57:40,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:57:40,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445913900] [2025-03-04 00:57:40,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445913900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:40,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:40,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:57:40,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050034711] [2025-03-04 00:57:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:40,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:57:40,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:57:40,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:57:40,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:57:40,915 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 00:57:44,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:57:45,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:57:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:46,347 INFO L93 Difference]: Finished difference Result 179 states and 263 transitions. [2025-03-04 00:57:46,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:57:46,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2025-03-04 00:57:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:46,378 INFO L225 Difference]: With dead ends: 179 [2025-03-04 00:57:46,378 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 00:57:46,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:57:46,379 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 84 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:46,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 421 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-04 00:57:46,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 00:57:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2025-03-04 00:57:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 00:57:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2025-03-04 00:57:46,394 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 125 [2025-03-04 00:57:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:46,394 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2025-03-04 00:57:46,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-04 00:57:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2025-03-04 00:57:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 00:57:46,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:46,396 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:46,411 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 (3)] Ended with exit code 0 [2025-03-04 00:57:46,596 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:57:46,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:46,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash 161034544, now seen corresponding path program 1 times [2025-03-04 00:57:46,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:57:46,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582552786] [2025-03-04 00:57:46,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:46,598 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:57:46,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:57:46,600 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:57:46,601 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:57:46,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 00:57:46,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 00:57:46,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:46,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:46,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:57:46,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:58:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-03-04 00:58:04,405 INFO L312 TraceCheckSpWp]: Computing backward predicates...