./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.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 ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:11:33,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:11:33,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:11:33,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:11:33,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:11:33,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:11:33,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:11:33,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:11:33,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:11:33,441 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:11:33,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:11:33,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:11:33,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:11:33,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:11:33,442 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:11:33,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:11:33,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:11:33,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:11:33,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:11:33,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:11:33,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:11:33,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:11:33,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:11:33,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:11:33,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:11:33,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:11:33,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:11:33,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:11:33,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:11:33,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:11:33,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:11:33,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:11:33,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:11:33,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:11:33,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:11:33,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:11:33,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:11:33,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:11:33,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:11:33,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:11:33,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:11:33,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:11:33,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:11:33,445 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 -> ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 [2025-03-17 05:11:33,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:11:33,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:11:33,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:11:33,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:11:33,667 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:11:33,669 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-38.i [2025-03-17 05:11:34,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ea488ed/5b4d325f4ae8404e90be1fc20e3bfe9d/FLAG6db762ec2 [2025-03-17 05:11:35,140 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:11:35,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i [2025-03-17 05:11:35,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ea488ed/5b4d325f4ae8404e90be1fc20e3bfe9d/FLAG6db762ec2 [2025-03-17 05:11:35,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ea488ed/5b4d325f4ae8404e90be1fc20e3bfe9d [2025-03-17 05:11:35,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:11:35,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:11:35,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:11:35,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:11:35,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:11:35,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7945a1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35, skipping insertion in model container [2025-03-17 05:11:35,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:11:35,302 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-38.i[913,926] [2025-03-17 05:11:35,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:11:35,353 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:11:35,361 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-38.i[913,926] [2025-03-17 05:11:35,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:11:35,400 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:11:35,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35 WrapperNode [2025-03-17 05:11:35,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:11:35,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:11:35,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:11:35,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:11:35,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,449 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-17 05:11:35,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:11:35,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:11:35,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:11:35,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:11:35,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,482 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 05:11:35,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:11:35,505 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:11:35,505 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:11:35,506 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:11:35,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (1/1) ... [2025-03-17 05:11:35,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:11:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:11:35,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:11:35,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:11:35,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:11:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:11:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:11:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:11:35,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:11:35,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:11:35,613 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:11:35,615 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:11:35,807 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 05:11:35,807 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:11:35,815 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:11:35,815 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:11:35,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:11:35 BoogieIcfgContainer [2025-03-17 05:11:35,815 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:11:35,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:11:35,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:11:35,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:11:35,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:11:35" (1/3) ... [2025-03-17 05:11:35,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434b5905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:11:35, skipping insertion in model container [2025-03-17 05:11:35,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:35" (2/3) ... [2025-03-17 05:11:35,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434b5905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:11:35, skipping insertion in model container [2025-03-17 05:11:35,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:11:35" (3/3) ... [2025-03-17 05:11:35,823 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-38.i [2025-03-17 05:11:35,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:11:35,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-38.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:11:35,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:11:35,889 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;@61a7a5d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:11:35,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:11:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:11:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:11:35,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:11:35,905 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:11:35,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:11:35,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:11:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1190203308, now seen corresponding path program 1 times [2025-03-17 05:11:35,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:11:35,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132396081] [2025-03-17 05:11:35,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:35,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:11:36,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:11:36,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:11:36,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:36,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:11:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 05:11:36,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:11:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132396081] [2025-03-17 05:11:36,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132396081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:11:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482399832] [2025-03-17 05:11:36,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:36,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:11:36,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:11:36,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:11:36,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:11:36,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:11:36,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:11:36,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:36,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:11:36,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:11:36,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:11:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 05:11:36,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:11:36,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482399832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:11:36,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:11:36,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:11:36,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120051921] [2025-03-17 05:11:36,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:11:36,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:11:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:11:36,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:11:36,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:11:36,360 INFO L87 Difference]: Start difference. First operand has 57 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 05:11:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:11:36,381 INFO L93 Difference]: Finished difference Result 111 states and 194 transitions. [2025-03-17 05:11:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:11:36,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 144 [2025-03-17 05:11:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:11:36,387 INFO L225 Difference]: With dead ends: 111 [2025-03-17 05:11:36,388 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 05:11:36,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:11:36,393 INFO L435 NwaCegarLoop]: 82 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, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:11:36,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:11:36,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 05:11:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-17 05:11:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:11:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2025-03-17 05:11:36,435 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 144 [2025-03-17 05:11:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:11:36,435 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2025-03-17 05:11:36,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 05:11:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2025-03-17 05:11:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:11:36,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:11:36,437 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:11:36,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:11:36,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:11:36,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:11:36,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:11:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1392314544, now seen corresponding path program 1 times [2025-03-17 05:11:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:11:36,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558145438] [2025-03-17 05:11:36,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:36,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:11:36,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:11:36,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:11:36,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:36,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:11:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 05:11:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:11:36,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558145438] [2025-03-17 05:11:36,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558145438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:11:36,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:11:36,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:11:36,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376856243] [2025-03-17 05:11:36,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:11:36,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:11:36,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:11:36,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:11:36,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:11:36,830 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 05:11:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:11:36,863 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2025-03-17 05:11:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:11:36,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 144 [2025-03-17 05:11:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:11:36,865 INFO L225 Difference]: With dead ends: 141 [2025-03-17 05:11:36,865 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 05:11:36,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:11:36,866 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:11:36,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 152 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:11:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 05:11:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-17 05:11:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:11:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2025-03-17 05:11:36,882 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 144 [2025-03-17 05:11:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:11:36,882 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2025-03-17 05:11:36,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 05:11:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2025-03-17 05:11:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:11:36,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:11:36,885 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:11:36,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:11:36,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:11:36,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:11:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1392284753, now seen corresponding path program 1 times [2025-03-17 05:11:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:11:36,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455770506] [2025-03-17 05:11:36,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:11:36,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:11:37,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:11:37,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:37,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:11:37,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:11:37,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:11:37,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:11:37,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:37,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:11:37,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:11:37,165 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:11:37,166 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:11:37,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:11:37,172 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 05:11:37,269 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:11:37,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:11:37 BoogieIcfgContainer [2025-03-17 05:11:37,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:11:37,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:11:37,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:11:37,275 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:11:37,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:11:35" (3/4) ... [2025-03-17 05:11:37,277 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:11:37,278 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:11:37,278 INFO L158 Benchmark]: Toolchain (without parser) took 2103.38ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2025-03-17 05:11:37,278 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:11:37,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.78ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:11:37,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.46ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:11:37,280 INFO L158 Benchmark]: Boogie Preprocessor took 51.32ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 86.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:11:37,280 INFO L158 Benchmark]: IcfgBuilder took 309.95ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 67.0MB in the end (delta: 19.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 05:11:37,280 INFO L158 Benchmark]: TraceAbstraction took 1456.86ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 95.1MB in the end (delta: -29.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2025-03-17 05:11:37,281 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 94.1MB in the end (delta: 939.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:11:37,282 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.82ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.78ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 92.2MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.46ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.32ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 86.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 309.95ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 67.0MB in the end (delta: 19.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1456.86ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 95.1MB in the end (delta: -29.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 94.1MB in the end (delta: 939.0kB). 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 someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_2 = 56507; [L24] unsigned short int var_1_3 = 52902; [L25] unsigned short int var_1_4 = 8; [L26] unsigned long int var_1_5 = 16; [L27] unsigned long int var_1_6 = 1771558822; [L28] double var_1_7 = 7.25; [L29] double var_1_8 = 31.2; [L30] double var_1_9 = 32.71; [L31] double var_1_10 = 0.4; [L32] double var_1_11 = 7.75; [L33] unsigned short int var_1_12 = 32; [L34] unsigned char var_1_13 = 0; [L35] unsigned short int var_1_14 = 20114; [L36] unsigned short int var_1_15 = 32; [L37] unsigned short int var_1_16 = 16773; [L38] unsigned short int var_1_17 = 25; [L39] unsigned char var_1_18 = 0; [L40] unsigned char var_1_19 = 1; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_ushort() [L66] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L68] var_1_3 = __VERIFIER_nondet_ushort() [L69] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L71] var_1_4 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L73] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L73] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L74] var_1_6 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_6 >= 1610612735) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L75] RET assume_abort_if_not(var_1_6 >= 1610612735) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L76] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L76] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L77] var_1_8 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L78] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4, var_1_9=3271/100] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L80] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L82] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L84] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L85] var_1_13 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L87] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L87] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L88] var_1_14 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L89] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L90] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L90] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L91] var_1_15 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L93] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L93] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L94] var_1_16 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_16 >= 16384) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L95] RET assume_abort_if_not(var_1_16 >= 16384) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L96] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L96] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L97] var_1_18 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L98] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L99] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L99] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L100] var_1_19 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L101] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L102] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L102] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=0, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L115] RET updateVariables() [L116] CALL step() [L44] var_1_1 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4) [L45] unsigned short int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=32767, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L46] COND FALSE !(var_1_4 > stepLocal_0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647, var_1_7=29/4] [L49] var_1_7 = (var_1_8 + (var_1_9 + (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] [L50] COND TRUE ! var_1_13 [L51] var_1_12 = (var_1_3 - (var_1_14 - var_1_15)) VAL [isInitial=1, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] [L59] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, stepLocal_1=-256, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] [L60] COND FALSE !((var_1_13 && var_1_18) && stepLocal_1) VAL [isInitial=1, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] [L116] RET step() [L117] CALL, EXPR property() [L107-L108] return ((((var_1_1 == ((unsigned short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4))) && ((var_1_4 > var_1_2) ? (var_1_5 == ((unsigned long int) (((var_1_6 - var_1_3) + 2144048120u) - var_1_2))) : 1)) && (var_1_7 == ((double) (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))))) && ((! var_1_13) ? (var_1_12 == ((unsigned short int) (var_1_3 - (var_1_14 - var_1_15)))) : (var_1_13 ? (var_1_12 == ((unsigned short int) ((27636 + var_1_16) - (((((16853 - 10)) > (var_1_14)) ? ((16853 - 10)) : (var_1_14)))))) : (var_1_12 == ((unsigned short int) var_1_3))))) && (((var_1_13 && var_1_18) && var_1_19) ? (var_1_17 == ((unsigned short int) (var_1_15 + var_1_14))) : 1) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] [L19] reach_error() VAL [isInitial=1, var_1_12=32768, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16384, var_1_17=25, var_1_18=1, var_1_19=-256, var_1_1=1, var_1_2=32767, var_1_3=-1073643520, var_1_4=-32769, var_1_5=16, var_1_6=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 110 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 234 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 162 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 321 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3266/3312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:11:37,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-38.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 ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:11:39,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:11:39,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:11:39,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:11:39,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:11:39,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:11:39,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:11:39,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:11:39,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:11:39,390 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:11:39,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:11:39,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:11:39,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:11:39,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:11:39,391 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:11:39,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:11:39,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:11:39,391 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:11:39,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:11:39,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:11:39,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:11:39,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:11:39,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:11:39,392 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:11:39,392 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:11:39,392 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:11:39,392 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:11:39,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:11:39,393 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:11:39,393 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:11:39,393 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:11:39,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:11:39,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:11:39,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:11:39,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:11:39,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:11:39,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:11:39,394 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:11:39,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:11:39,394 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:11:39,394 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:11:39,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:11:39,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:11:39,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:11:39,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:11:39,395 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 -> ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 [2025-03-17 05:11:39,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:11:39,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:11:39,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:11:39,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:11:39,678 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:11:39,679 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-38.i [2025-03-17 05:11:40,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5266707ef/7678cf9fad4c4d4fb7d6d80d321d7985/FLAGf1e91bd3a [2025-03-17 05:11:41,184 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:11:41,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i [2025-03-17 05:11:41,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5266707ef/7678cf9fad4c4d4fb7d6d80d321d7985/FLAGf1e91bd3a [2025-03-17 05:11:41,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5266707ef/7678cf9fad4c4d4fb7d6d80d321d7985 [2025-03-17 05:11:41,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:11:41,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:11:41,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:11:41,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:11:41,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:11:41,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528a61b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41, skipping insertion in model container [2025-03-17 05:11:41,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:11:41,654 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-38.i[913,926] [2025-03-17 05:11:41,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:11:41,703 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:11:41,711 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-38.i[913,926] [2025-03-17 05:11:41,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:11:41,738 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:11:41,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41 WrapperNode [2025-03-17 05:11:41,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:11:41,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:11:41,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:11:41,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:11:41,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,768 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-17 05:11:41,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:11:41,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:11:41,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:11:41,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:11:41,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,790 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 05:11:41,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:11:41,807 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:11:41,807 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:11:41,807 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:11:41,808 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (1/1) ... [2025-03-17 05:11:41,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:11:41,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:11:41,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:11:41,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:11:41,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:11:41,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:11:41,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:11:41,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:11:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:11:41,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:11:41,915 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:11:41,916 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:11:46,897 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 05:11:46,898 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:11:46,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:11:46,908 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:11:46,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:11:46 BoogieIcfgContainer [2025-03-17 05:11:46,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:11:46,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:11:46,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:11:46,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:11:46,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:11:41" (1/3) ... [2025-03-17 05:11:46,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca4c271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:11:46, skipping insertion in model container [2025-03-17 05:11:46,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:11:41" (2/3) ... [2025-03-17 05:11:46,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca4c271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:11:46, skipping insertion in model container [2025-03-17 05:11:46,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:11:46" (3/3) ... [2025-03-17 05:11:46,916 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-38.i [2025-03-17 05:11:46,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:11:46,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-38.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:11:46,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:11:46,982 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;@15ab6b10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:11:46,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:11:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:11:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:11:46,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:11:46,995 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:11:46,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:11:47,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:11:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1190203308, now seen corresponding path program 1 times [2025-03-17 05:11:47,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:11:47,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885525515] [2025-03-17 05:11:47,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:47,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:11:47,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:11:47,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:11:47,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:11:47,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:11:47,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:11:47,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:47,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:11:47,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:11:47,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:11:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-03-17 05:11:47,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:11:47,393 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:11:47,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885525515] [2025-03-17 05:11:47,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885525515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:11:47,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:11:47,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:11:47,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254498193] [2025-03-17 05:11:47,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:11:47,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:11:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:11:47,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:11:47,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:11:47,414 INFO L87 Difference]: Start difference. First operand has 57 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 05:11:47,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:11:47,432 INFO L93 Difference]: Finished difference Result 111 states and 194 transitions. [2025-03-17 05:11:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:11:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 144 [2025-03-17 05:11:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:11:47,440 INFO L225 Difference]: With dead ends: 111 [2025-03-17 05:11:47,440 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 05:11:47,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:11:47,444 INFO L435 NwaCegarLoop]: 82 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, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:11:47,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:11:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 05:11:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-17 05:11:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:11:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2025-03-17 05:11:47,478 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 144 [2025-03-17 05:11:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:11:47,479 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2025-03-17 05:11:47,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 05:11:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2025-03-17 05:11:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:11:47,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:11:47,481 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:11:47,493 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-17 05:11:47,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:11:47,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:11:47,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:11:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1392314544, now seen corresponding path program 1 times [2025-03-17 05:11:47,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:11:47,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138830631] [2025-03-17 05:11:47,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:47,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:11:47,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:11:47,687 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:11:47,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:11:47,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:11:47,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:11:47,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:47,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:11:47,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 05:11:47,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:11:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 05:11:48,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:11:48,003 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:11:48,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138830631] [2025-03-17 05:11:48,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138830631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:11:48,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:11:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:11:48,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969059309] [2025-03-17 05:11:48,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:11:48,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:11:48,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:11:48,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:11:48,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:11:48,007 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 05:11:51,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 05:11:54,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 05:11:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:11:54,817 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2025-03-17 05:11:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:11:54,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 144 [2025-03-17 05:11:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:11:54,847 INFO L225 Difference]: With dead ends: 141 [2025-03-17 05:11:54,847 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 05:11:54,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:11:54,848 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:11:54,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 151 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-03-17 05:11:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 05:11:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-17 05:11:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 46 states have internal predecessors, (51), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:11:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2025-03-17 05:11:54,872 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 144 [2025-03-17 05:11:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:11:54,873 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2025-03-17 05:11:54,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 05:11:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2025-03-17 05:11:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:11:54,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:11:54,876 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:11:54,887 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-17 05:11:55,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:11:55,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:11:55,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:11:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1392284753, now seen corresponding path program 1 times [2025-03-17 05:11:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:11:55,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312371170] [2025-03-17 05:11:55,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:11:55,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:11:55,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:11:55,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:11:55,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:11:55,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:11:55,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:11:55,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:11:55,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:11:55,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 05:11:55,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:12:31,965 WARN L286 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 05:12:37,034 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 05:12:50,860 WARN L286 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 05:13:08,678 WARN L286 SmtUtils]: Spent 7.13s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 05:13:15,394 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)