./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_fillercode_fillercodestructure_filler-pe-ci_file-77.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 b3ab8989cae4393a8cbf1c0c6e0a27c5ce2ad38815cddf562090bcf36daabdd7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:44:42,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:44:42,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:44:42,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:44:42,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:44:42,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:44:42,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:44:42,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:44:42,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:44:42,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:44:42,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:44:42,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:44:42,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:44:42,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:44:42,363 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:44:42,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:44:42,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:44:42,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:44:42,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:44:42,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:44:42,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:44:42,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:44:42,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:44:42,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:44:42,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:44:42,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:44:42,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:44:42,365 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 -> b3ab8989cae4393a8cbf1c0c6e0a27c5ce2ad38815cddf562090bcf36daabdd7 [2025-03-08 11:44:42,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:44:42,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:44:42,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:44:42,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:44:42,606 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:44:42,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2025-03-08 11:44:43,767 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/effaf33f5/9182b485fff344448c36621af09380fd/FLAG9668daea5 [2025-03-08 11:44:44,029 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:44:44,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2025-03-08 11:44:44,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/effaf33f5/9182b485fff344448c36621af09380fd/FLAG9668daea5 [2025-03-08 11:44:44,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/effaf33f5/9182b485fff344448c36621af09380fd [2025-03-08 11:44:44,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:44:44,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:44:44,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:44:44,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:44:44,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:44:44,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dbe50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44, skipping insertion in model container [2025-03-08 11:44:44,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:44:44,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i[919,932] [2025-03-08 11:44:44,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:44:44,252 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:44:44,259 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_fillercode_fillercodestructure_filler-pe-ci_file-77.i[919,932] [2025-03-08 11:44:44,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:44:44,314 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:44:44,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44 WrapperNode [2025-03-08 11:44:44,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:44:44,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:44:44,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:44:44,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:44:44,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,363 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 231 [2025-03-08 11:44:44,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:44:44,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:44:44,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:44:44,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:44:44,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,389 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-08 11:44:44,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:44:44,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:44:44,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:44:44,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:44:44,420 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (1/1) ... [2025-03-08 11:44:44,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:44:44,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:44:44,447 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-08 11:44:44,452 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-08 11:44:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:44:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:44:44,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:44:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:44:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:44:44,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:44:44,531 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:44:44,532 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:44:44,843 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 11:44:44,843 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:44:44,861 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:44:44,861 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:44:44,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:44:44 BoogieIcfgContainer [2025-03-08 11:44:44,862 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:44:44,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:44:44,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:44:44,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:44:44,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:44:44" (1/3) ... [2025-03-08 11:44:44,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5395f8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:44:44, skipping insertion in model container [2025-03-08 11:44:44,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:44" (2/3) ... [2025-03-08 11:44:44,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5395f8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:44:44, skipping insertion in model container [2025-03-08 11:44:44,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:44:44" (3/3) ... [2025-03-08 11:44:44,870 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2025-03-08 11:44:44,880 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:44:44,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:44:44,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:44:44,935 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;@136d89ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:44:44,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:44:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:44:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:44:44,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:44:44,950 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:44:44,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:44:44,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:44:44,955 INFO L85 PathProgramCache]: Analyzing trace with hash 558442972, now seen corresponding path program 1 times [2025-03-08 11:44:44,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:44:44,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43191984] [2025-03-08 11:44:44,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:44:45,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:44:45,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:44:45,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:45,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 11:44:45,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:44:45,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43191984] [2025-03-08 11:44:45,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43191984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:44:45,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403480780] [2025-03-08 11:44:45,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:45,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:44:45,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:44:45,246 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-08 11:44:45,248 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-08 11:44:45,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:44:45,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:44:45,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:45,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:45,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:44:45,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:44:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-08 11:44:45,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:44:45,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403480780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:44:45,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:44:45,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:44:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791259736] [2025-03-08 11:44:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:44:45,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:44:45,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:44:45,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:44:45,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:44:45,467 INFO L87 Difference]: Start difference. First operand has 101 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 67 states have internal predecessors, (97), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 11:44:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:44:45,501 INFO L93 Difference]: Finished difference Result 196 states and 349 transitions. [2025-03-08 11:44:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:44:45,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-03-08 11:44:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:44:45,508 INFO L225 Difference]: With dead ends: 196 [2025-03-08 11:44:45,509 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 11:44:45,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 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-08 11:44:45,515 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:44:45,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:44:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 11:44:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 11:44:45,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.421875) internal successors, (91), 64 states have internal predecessors, (91), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:44:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2025-03-08 11:44:45,558 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 203 [2025-03-08 11:44:45,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:44:45,558 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2025-03-08 11:44:45,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 11:44:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2025-03-08 11:44:45,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:44:45,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:44:45,562 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:44:45,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:44:45,763 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-08 11:44:45,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:44:45,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:44:45,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1449364899, now seen corresponding path program 1 times [2025-03-08 11:44:45,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:44:45,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534437312] [2025-03-08 11:44:45,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:45,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:44:45,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:44:45,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:44:45,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:45,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 11:44:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:44:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534437312] [2025-03-08 11:44:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534437312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:44:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:44:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:44:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344675631] [2025-03-08 11:44:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:44:46,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:44:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:44:46,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:44:46,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:44:46,210 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 11:44:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:44:46,504 INFO L93 Difference]: Finished difference Result 317 states and 504 transitions. [2025-03-08 11:44:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:44:46,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-03-08 11:44:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:44:46,507 INFO L225 Difference]: With dead ends: 317 [2025-03-08 11:44:46,507 INFO L226 Difference]: Without dead ends: 222 [2025-03-08 11:44:46,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:44:46,508 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 253 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:44:46,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 824 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:44:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-08 11:44:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2025-03-08 11:44:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 11:44:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 303 transitions. [2025-03-08 11:44:46,541 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 303 transitions. Word has length 203 [2025-03-08 11:44:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:44:46,541 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 303 transitions. [2025-03-08 11:44:46,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 11:44:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 303 transitions. [2025-03-08 11:44:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:44:46,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:44:46,546 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:44:46,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:44:46,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:44:46,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:44:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1954923524, now seen corresponding path program 1 times [2025-03-08 11:44:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:44:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726876062] [2025-03-08 11:44:46,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:44:46,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:44:46,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:44:46,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:46,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 11:44:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:44:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726876062] [2025-03-08 11:44:46,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726876062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:44:46,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:44:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:44:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402253162] [2025-03-08 11:44:46,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:44:46,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:44:46,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:44:46,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:44:46,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:44:46,686 INFO L87 Difference]: Start difference. First operand 190 states and 303 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:44:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:44:46,725 INFO L93 Difference]: Finished difference Result 349 states and 557 transitions. [2025-03-08 11:44:46,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:44:46,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-03-08 11:44:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:44:46,729 INFO L225 Difference]: With dead ends: 349 [2025-03-08 11:44:46,729 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 11:44:46,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:44:46,730 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:44:46,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:44:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 11:44:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 97. [2025-03-08 11:44:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:44:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2025-03-08 11:44:46,742 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 203 [2025-03-08 11:44:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:44:46,743 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2025-03-08 11:44:46,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:44:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2025-03-08 11:44:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:44:46,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:44:46,758 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:44:46,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:44:46,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:44:46,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:44:46,759 INFO L85 PathProgramCache]: Analyzing trace with hash -952930340, now seen corresponding path program 1 times [2025-03-08 11:44:46,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:44:46,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521258567] [2025-03-08 11:44:46,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:46,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:44:46,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:44:46,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:44:46,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:46,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-08 11:44:47,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:44:47,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521258567] [2025-03-08 11:44:47,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521258567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:44:47,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823984396] [2025-03-08 11:44:47,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:47,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:44:47,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:44:47,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:44:47,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:44:47,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:44:47,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:44:47,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:47,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:47,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:44:47,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:44:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2025-03-08 11:44:47,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:44:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-08 11:44:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823984396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:44:47,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:44:47,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 11:44:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007007314] [2025-03-08 11:44:47,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:44:47,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:44:47,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:44:47,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:44:47,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:44:47,729 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-08 11:44:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:44:47,931 INFO L93 Difference]: Finished difference Result 199 states and 308 transitions. [2025-03-08 11:44:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:44:47,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 203 [2025-03-08 11:44:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:44:47,933 INFO L225 Difference]: With dead ends: 199 [2025-03-08 11:44:47,933 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 11:44:47,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 403 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:44:47,936 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 77 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:44:47,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 247 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:44:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 11:44:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-03-08 11:44:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:44:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2025-03-08 11:44:47,951 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 203 [2025-03-08 11:44:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:44:47,953 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2025-03-08 11:44:47,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-08 11:44:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2025-03-08 11:44:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 11:44:47,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:44:47,956 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:44:47,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:44:48,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 11:44:48,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:44:48,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:44:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash 963358692, now seen corresponding path program 1 times [2025-03-08 11:44:48,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:44:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691242212] [2025-03-08 11:44:48,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:44:48,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 11:44:48,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 11:44:48,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:48,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 11:44:48,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:44:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691242212] [2025-03-08 11:44:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691242212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:44:48,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:44:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:44:48,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924662055] [2025-03-08 11:44:48,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:44:48,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:44:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:44:48,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:44:48,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:44:48,381 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:44:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:44:48,412 INFO L93 Difference]: Finished difference Result 199 states and 299 transitions. [2025-03-08 11:44:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:44:48,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2025-03-08 11:44:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:44:48,415 INFO L225 Difference]: With dead ends: 199 [2025-03-08 11:44:48,415 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 11:44:48,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:44:48,417 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 133 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:44:48,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 163 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:44:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 11:44:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 11:44:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:44:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2025-03-08 11:44:48,434 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 204 [2025-03-08 11:44:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:44:48,434 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2025-03-08 11:44:48,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:44:48,435 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2025-03-08 11:44:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 11:44:48,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:44:48,437 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:44:48,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:44:48,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:44:48,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:44:48,437 INFO L85 PathProgramCache]: Analyzing trace with hash 4305375, now seen corresponding path program 1 times [2025-03-08 11:44:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:44:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13203558] [2025-03-08 11:44:48,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:48,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:44:48,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 11:44:48,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 11:44:48,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:48,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 114 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-03-08 11:44:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:44:48,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13203558] [2025-03-08 11:44:48,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13203558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:44:48,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570137732] [2025-03-08 11:44:48,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:48,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:44:48,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:44:48,825 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:44:48,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:44:48,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 11:44:48,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 11:44:48,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:48,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:48,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 11:44:48,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:44:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-08 11:44:49,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:44:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 66 proven. 117 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2025-03-08 11:44:49,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570137732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:44:49,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:44:49,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2025-03-08 11:44:49,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787518371] [2025-03-08 11:44:49,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:44:49,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:44:49,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:44:49,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:44:49,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:44:49,840 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 15 states, 15 states have (on average 7.6) internal successors, (114), 15 states have internal predecessors, (114), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2025-03-08 11:44:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:44:50,175 INFO L93 Difference]: Finished difference Result 215 states and 311 transitions. [2025-03-08 11:44:50,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 11:44:50,176 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 15 states have internal predecessors, (114), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) Word has length 205 [2025-03-08 11:44:50,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:44:50,177 INFO L225 Difference]: With dead ends: 215 [2025-03-08 11:44:50,177 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 11:44:50,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:44:50,178 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 67 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:44:50,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 309 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:44:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 11:44:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2025-03-08 11:44:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:44:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2025-03-08 11:44:50,196 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 205 [2025-03-08 11:44:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:44:50,199 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2025-03-08 11:44:50,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 15 states have internal predecessors, (114), 6 states have call successors, (74), 3 states have call predecessors, (74), 7 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2025-03-08 11:44:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2025-03-08 11:44:50,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 11:44:50,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:44:50,201 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:44:50,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 11:44:50,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:44:50,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:44:50,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:44:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash -238032670, now seen corresponding path program 1 times [2025-03-08 11:44:50,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:44:50,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427723761] [2025-03-08 11:44:50,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:50,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:44:50,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 11:44:50,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 11:44:50,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:50,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 177 refuted. 0 times theorem prover too weak. 1723 trivial. 0 not checked. [2025-03-08 11:44:50,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:44:50,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427723761] [2025-03-08 11:44:50,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427723761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:44:50,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972565275] [2025-03-08 11:44:50,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:50,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:44:50,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:44:50,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:44:50,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 11:44:51,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 11:44:51,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 11:44:51,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:51,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:44:51,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 11:44:51,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:44:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1321 proven. 177 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-08 11:44:52,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:44:52,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972565275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:44:52,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:44:52,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 16 [2025-03-08 11:44:52,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348701662] [2025-03-08 11:44:52,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:44:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 11:44:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:44:52,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 11:44:52,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-08 11:44:52,725 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 7 states have call successors, (54), 5 states have call predecessors, (54), 7 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) [2025-03-08 11:44:53,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:44:53,643 INFO L93 Difference]: Finished difference Result 325 states and 447 transitions. [2025-03-08 11:44:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 11:44:53,644 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 7 states have call successors, (54), 5 states have call predecessors, (54), 7 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) Word has length 206 [2025-03-08 11:44:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:44:53,646 INFO L225 Difference]: With dead ends: 325 [2025-03-08 11:44:53,646 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 11:44:53,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=379, Invalid=1181, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 11:44:53,648 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 210 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:44:53,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 667 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:44:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 11:44:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2025-03-08 11:44:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 117 states have (on average 1.1538461538461537) internal successors, (135), 118 states have internal predecessors, (135), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 11:44:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 263 transitions. [2025-03-08 11:44:53,665 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 263 transitions. Word has length 206 [2025-03-08 11:44:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:44:53,667 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 263 transitions. [2025-03-08 11:44:53,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 7 states have call successors, (54), 5 states have call predecessors, (54), 7 states have return successors, (54), 7 states have call predecessors, (54), 7 states have call successors, (54) [2025-03-08 11:44:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 263 transitions. [2025-03-08 11:44:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 11:44:53,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:44:53,669 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:44:53,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 11:44:53,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:44:53,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:44:53,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:44:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash -107648188, now seen corresponding path program 1 times [2025-03-08 11:44:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:44:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146612985] [2025-03-08 11:44:53,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:44:53,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 11:44:53,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 11:44:53,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:53,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:44:53,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425973864] [2025-03-08 11:44:53,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:44:53,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:44:53,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:44:53,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:44:53,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 11:44:54,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 11:44:54,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 11:44:54,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:54,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:44:54,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:44:54,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 11:44:54,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 11:44:54,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:44:54,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:44:54,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:44:54,237 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:44:54,237 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:44:54,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 11:44:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:44:54,442 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:44:54,549 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:44:54,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:44:54 BoogieIcfgContainer [2025-03-08 11:44:54,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:44:54,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:44:54,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:44:54,552 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:44:54,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:44:44" (3/4) ... [2025-03-08 11:44:54,555 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:44:54,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:44:54,556 INFO L158 Benchmark]: Toolchain (without parser) took 10498.41ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 105.1MB in the beginning and 122.2MB in the end (delta: -17.1MB). Peak memory consumption was 173.0MB. Max. memory is 16.1GB. [2025-03-08 11:44:54,556 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:44:54,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.87ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 90.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:44:54,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.25ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 85.6MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:44:54,557 INFO L158 Benchmark]: Boogie Preprocessor took 54.46ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 80.4MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 11:44:54,557 INFO L158 Benchmark]: IcfgBuilder took 443.21ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 49.6MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 11:44:54,557 INFO L158 Benchmark]: TraceAbstraction took 9686.80ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 48.4MB in the beginning and 122.3MB in the end (delta: -73.9MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2025-03-08 11:44:54,557 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 327.2MB. Free memory was 122.3MB in the beginning and 122.2MB in the end (delta: 101.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 11:44:54,558 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.14ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.87ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 90.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.25ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 85.6MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.46ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 80.4MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 443.21ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 49.6MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9686.80ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 48.4MB in the beginning and 122.3MB in the end (delta: -73.9MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 327.2MB. Free memory was 122.3MB in the beginning and 122.2MB in the end (delta: 101.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 198, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 145. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] float var_1_6 = 255.25; [L27] unsigned short int var_1_7 = 16; [L28] signed char var_1_8 = -10; [L29] signed char var_1_9 = -8; [L30] unsigned short int var_1_10 = 8; [L31] unsigned short int var_1_11 = 10000; [L32] unsigned short int var_1_12 = 5; [L33] signed short int var_1_13 = 200; [L34] unsigned char var_1_15 = 0; [L35] unsigned short int var_1_16 = 35895; [L36] unsigned short int var_1_17 = 18336; [L37] unsigned char var_1_18 = 0; [L38] signed long int var_1_19 = -50; [L39] unsigned char var_1_20 = 10; [L40] unsigned char var_1_22 = 100; [L41] unsigned char var_1_23 = 16; [L42] signed long int var_1_24 = -256; [L43] unsigned char var_1_25 = 1; [L44] unsigned char var_1_30 = 25; [L45] signed char var_1_32 = 1; [L46] unsigned char var_1_33 = 200; [L47] unsigned char var_1_34 = 64; [L48] unsigned char var_1_35 = 64; [L49] unsigned char var_1_36 = 8; [L50] unsigned short int var_1_37 = 500; [L51] unsigned char var_1_38 = 32; [L52] unsigned short int var_1_39 = 25; [L53] signed char last_1_var_1_8 = -10; [L54] unsigned char last_1_var_1_15 = 0; [L55] signed long int last_1_var_1_19 = -50; VAL [isInitial=0, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_2=511/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L193] last_1_var_1_8 = var_1_8 [L194] last_1_var_1_15 = var_1_15 [L195] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_2=511/2, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L205] RET updateLastVariables() [L206] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L143] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_3=499/5, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L144] var_1_3 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L145] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=-25, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L146] var_1_4 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L147] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L149] var_1_6 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L150] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=16, var_1_8=-10, var_1_9=-8] [L151] var_1_7 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L152] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_8=-10, var_1_9=-8] [L153] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L153] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=-8] [L154] var_1_9 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L155] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L156] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L157] var_1_11 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L158] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L159] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L159] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=5, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L160] var_1_12 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L161] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L162] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L163] var_1_16 = __VERIFIER_nondet_ushort() [L164] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L164] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L165] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L165] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L166] var_1_17 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L167] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L168] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L169] var_1_18 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L170] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L171] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L171] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=100, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L172] var_1_22 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L173] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_22 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L174] RET assume_abort_if_not(var_1_22 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=1, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L175] var_1_32 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_32 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L176] RET assume_abort_if_not(var_1_32 >= -128) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L177] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L177] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L178] CALL assume_abort_if_not(var_1_32 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L178] RET assume_abort_if_not(var_1_32 != 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=200, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L179] var_1_33 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_33 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L180] RET assume_abort_if_not(var_1_33 >= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L181] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=64, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L182] var_1_34 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L183] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L184] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=64, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L185] var_1_35 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_35 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L186] RET assume_abort_if_not(var_1_35 >= 63) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L187] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=8, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L188] var_1_36 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L189] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L190] CALL assume_abort_if_not(var_1_36 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L190] RET assume_abort_if_not(var_1_36 <= 63) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L206] RET updateVariables() [L207] CALL step() [L59] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_0=1, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L60] COND FALSE !(stepLocal_0 <= last_1_var_1_8) [L67] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=-10, var_1_9=1] [L69] COND TRUE (- var_1_7) < (var_1_1 * var_1_4) [L70] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L72] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L79] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L80] COND FALSE !(var_1_3 != var_1_6) [L87] var_1_15 = var_1_18 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, var_1_10=8, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L89] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) [L90] unsigned short int stepLocal_4 = var_1_1; [L91] signed long int stepLocal_3 = var_1_7 + (128 + var_1_1); [L92] signed long int stepLocal_2 = - var_1_10; VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_2=-18232, stepLocal_3=130, stepLocal_4=-65535, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L93] COND FALSE !(var_1_1 < stepLocal_2) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, stepLocal_4=-65535, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=-50, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L98] COND TRUE stepLocal_4 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11) [L99] var_1_19 = ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L104] COND FALSE !(var_1_7 <= -1) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=16, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L107] var_1_23 = var_1_22 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L108] EXPR var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L108] EXPR var_1_8 & (var_1_22 >> var_1_4) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-256, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L108] COND TRUE var_1_13 >= (var_1_8 & (var_1_22 >> var_1_4)) [L109] var_1_24 = (var_1_22 - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L115] COND TRUE var_1_16 >= (-128 & var_1_11) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L116] COND FALSE !((((((var_1_3) > (var_1_3)) ? (var_1_3) : (var_1_3))) <= var_1_3) && var_1_18) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L122] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L125] COND TRUE ! var_1_15 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=25, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L126] COND TRUE (var_1_9 % var_1_32) <= var_1_11 [L127] var_1_30 = (var_1_33 - ((((var_1_34) > ((var_1_35 - var_1_36))) ? (var_1_34) : ((var_1_35 - var_1_36))))) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L131] COND TRUE ((((var_1_1) > (var_1_10)) ? (var_1_1) : (var_1_10))) > var_1_32 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L132] COND TRUE ! var_1_18 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L133] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=32, var_1_39=25, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L138] var_1_38 = var_1_34 [L139] var_1_39 = var_1_11 VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, stepLocal_1=256, stepLocal_3=130, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=73728, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= last_1_var_1_8) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_1 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (last_1_var_1_15 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_13 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_1 < (- var_1_10)) ? (((var_1_7 + (128 + var_1_1)) <= last_1_var_1_19) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_1 < (((((var_1_10) < (var_1_17)) ? (var_1_10) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=73728, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=73728, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, last_1_var_1_19=-50, last_1_var_1_8=-10, var_1_10=18232, var_1_11=73728, var_1_12=-196598, var_1_13=200, var_1_15=0, var_1_16=32767, var_1_17=32767, var_1_18=0, var_1_19=1, var_1_1=-65535, var_1_20=10, var_1_22=0, var_1_23=0, var_1_24=-200, var_1_25=1, var_1_30=64, var_1_32=2, var_1_33=127, var_1_34=0, var_1_35=63, var_1_36=0, var_1_37=500, var_1_38=0, var_1_39=73728, var_1_4=1, var_1_7=-65535, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 193 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 8, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 778 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 740 mSDsluCounter, 2647 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1652 mSDsCounter, 304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1531 IncrementalHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 304 mSolverCounterUnsat, 995 mSDtfsCounter, 1531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1432 GetRequests, 1354 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=7, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 133 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 2660 NumberOfCodeBlocks, 2660 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2639 ConstructedInterpolants, 0 QuantifiedInterpolants, 9234 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1887 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 24914/25792 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-08 11:44:54,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.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 b3ab8989cae4393a8cbf1c0c6e0a27c5ce2ad38815cddf562090bcf36daabdd7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:44:56,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:44:56,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:44:56,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:44:56,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:44:56,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:44:56,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:44:56,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:44:56,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:44:56,636 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:44:56,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:44:56,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:44:56,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:44:56,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:44:56,637 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:44:56,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:44:56,638 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:44:56,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:44:56,639 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:44:56,639 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:44:56,639 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:44:56,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:44:56,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:44:56,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:44:56,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:44:56,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:44:56,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:44:56,639 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:44:56,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:44:56,640 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:44:56,640 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:44:56,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:44:56,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:44:56,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:44:56,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:44:56,640 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 -> b3ab8989cae4393a8cbf1c0c6e0a27c5ce2ad38815cddf562090bcf36daabdd7 [2025-03-08 11:44:56,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:44:56,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:44:56,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:44:56,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:44:56,906 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:44:56,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2025-03-08 11:44:58,098 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5eeb13c7/690d4cc7f1614487b4f163f537da3b45/FLAG4eaeba4e2 [2025-03-08 11:44:58,304 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:44:58,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2025-03-08 11:44:58,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5eeb13c7/690d4cc7f1614487b4f163f537da3b45/FLAG4eaeba4e2 [2025-03-08 11:44:58,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5eeb13c7/690d4cc7f1614487b4f163f537da3b45 [2025-03-08 11:44:58,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:44:58,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:44:58,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:44:58,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:44:58,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:44:58,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:58,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3131c9e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58, skipping insertion in model container [2025-03-08 11:44:58,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:58,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:44:58,812 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_fillercode_fillercodestructure_filler-pe-ci_file-77.i[919,932] [2025-03-08 11:44:58,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:44:58,870 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:44:58,878 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_fillercode_fillercodestructure_filler-pe-ci_file-77.i[919,932] [2025-03-08 11:44:58,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:44:58,924 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:44:58,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58 WrapperNode [2025-03-08 11:44:58,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:44:58,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:44:58,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:44:58,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:44:58,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:58,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:58,969 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-03-08 11:44:58,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:44:58,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:44:58,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:44:58,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:44:58,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:58,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:58,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:59,002 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-08 11:44:59,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:59,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:59,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:59,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:59,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:59,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:59,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:44:59,014 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:44:59,015 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:44:59,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:44:59,015 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (1/1) ... [2025-03-08 11:44:59,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:44:59,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:44:59,042 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-08 11:44:59,045 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-08 11:44:59,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:44:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:44:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:44:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:44:59,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:44:59,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:44:59,145 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:44:59,147 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:45:00,369 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 11:45:00,370 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:45:00,382 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:45:00,382 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:45:00,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:45:00 BoogieIcfgContainer [2025-03-08 11:45:00,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:45:00,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:45:00,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:45:00,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:45:00,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:44:58" (1/3) ... [2025-03-08 11:45:00,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5512651d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:45:00, skipping insertion in model container [2025-03-08 11:45:00,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:44:58" (2/3) ... [2025-03-08 11:45:00,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5512651d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:45:00, skipping insertion in model container [2025-03-08 11:45:00,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:45:00" (3/3) ... [2025-03-08 11:45:00,391 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i [2025-03-08 11:45:00,401 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:45:00,402 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-77.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:45:00,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:45:00,458 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;@4ff3eaa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:45:00,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:45:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:45:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 11:45:00,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:00,472 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:45:00,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:00,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:00,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1369574646, now seen corresponding path program 1 times [2025-03-08 11:45:00,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:45:00,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324346249] [2025-03-08 11:45:00,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:00,485 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-08 11:45:00,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:45:00,487 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-08 11:45:00,489 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-08 11:45:00,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 11:45:00,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 11:45:00,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:00,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:00,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:45:00,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2025-03-08 11:45:00,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:45:00,776 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:45:00,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324346249] [2025-03-08 11:45:00,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324346249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:00,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:00,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:45:00,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351470332] [2025-03-08 11:45:00,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:00,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:45:00,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:45:00,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:45:00,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:45:00,800 INFO L87 Difference]: Start difference. First operand has 92 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 11:45:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:00,821 INFO L93 Difference]: Finished difference Result 178 states and 319 transitions. [2025-03-08 11:45:00,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:45:00,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2025-03-08 11:45:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:00,827 INFO L225 Difference]: With dead ends: 178 [2025-03-08 11:45:00,827 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 11:45:00,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 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-08 11:45:00,831 INFO L435 NwaCegarLoop]: 140 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, 140 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-08 11:45:00,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:45:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 11:45:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 11:45:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:45:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 140 transitions. [2025-03-08 11:45:00,866 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 140 transitions. Word has length 201 [2025-03-08 11:45:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:00,866 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 140 transitions. [2025-03-08 11:45:00,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 11:45:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2025-03-08 11:45:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 11:45:00,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:00,869 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:45:00,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 11:45:01,071 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-08 11:45:01,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:01,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash -612400713, now seen corresponding path program 1 times [2025-03-08 11:45:01,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:45:01,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165950803] [2025-03-08 11:45:01,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:01,072 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-08 11:45:01,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:45:01,075 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-08 11:45:01,076 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-08 11:45:01,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 11:45:01,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 11:45:01,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:01,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:01,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 11:45:01,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-08 11:45:01,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:45:01,361 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:45:01,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165950803] [2025-03-08 11:45:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165950803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:01,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:01,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:45:01,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672423599] [2025-03-08 11:45:01,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:01,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:45:01,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:45:01,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:45:01,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:45:01,366 INFO L87 Difference]: Start difference. First operand 89 states and 140 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:45:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:01,705 INFO L93 Difference]: Finished difference Result 174 states and 275 transitions. [2025-03-08 11:45:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:45:01,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 201 [2025-03-08 11:45:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:01,717 INFO L225 Difference]: With dead ends: 174 [2025-03-08 11:45:01,717 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 11:45:01,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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-08 11:45:01,718 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:01,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:45:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 11:45:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-08 11:45:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:45:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 137 transitions. [2025-03-08 11:45:01,726 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 137 transitions. Word has length 201 [2025-03-08 11:45:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:01,729 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 137 transitions. [2025-03-08 11:45:01,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 11:45:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 137 transitions. [2025-03-08 11:45:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-08 11:45:01,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:01,733 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:45:01,741 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-08 11:45:01,933 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-08 11:45:01,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash -647638282, now seen corresponding path program 1 times [2025-03-08 11:45:01,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:45:01,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930250045] [2025-03-08 11:45:01,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:01,936 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-08 11:45:01,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:45:01,938 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-08 11:45:01,939 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-08 11:45:01,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 11:45:02,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 11:45:02,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:02,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:02,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 11:45:02,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2025-03-08 11:45:02,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:45:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-08 11:45:02,670 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:45:02,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930250045] [2025-03-08 11:45:02,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930250045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:45:02,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:45:02,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 11:45:02,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834221695] [2025-03-08 11:45:02,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:45:02,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:45:02,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:45:02,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:45:02,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:45:02,671 INFO L87 Difference]: Start difference. First operand 88 states and 137 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-08 11:45:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:03,585 INFO L93 Difference]: Finished difference Result 181 states and 278 transitions. [2025-03-08 11:45:03,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:45:03,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 201 [2025-03-08 11:45:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:03,597 INFO L225 Difference]: With dead ends: 181 [2025-03-08 11:45:03,597 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 11:45:03,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:45:03,598 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 65 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:03,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 208 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:45:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 11:45:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-03-08 11:45:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:45:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2025-03-08 11:45:03,618 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 201 [2025-03-08 11:45:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:03,618 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2025-03-08 11:45:03,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-08 11:45:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2025-03-08 11:45:03,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 11:45:03,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:03,628 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:45:03,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 11:45:03,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:45:03,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:03,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:03,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1837477898, now seen corresponding path program 1 times [2025-03-08 11:45:03,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:45:03,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584614236] [2025-03-08 11:45:03,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:03,830 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-08 11:45:03,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:45:03,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:45:03,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 11:45:03,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 11:45:04,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 11:45:04,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:04,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:04,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 11:45:04,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:04,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1003 proven. 39 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2025-03-08 11:45:04,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:45:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 54 proven. 39 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-08 11:45:04,485 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:45:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584614236] [2025-03-08 11:45:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584614236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:45:04,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:45:04,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-08 11:45:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467318595] [2025-03-08 11:45:04,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:45:04,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:45:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:45:04,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:45:04,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:45:04,487 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-08 11:45:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:05,249 INFO L93 Difference]: Finished difference Result 185 states and 273 transitions. [2025-03-08 11:45:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:45:05,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 202 [2025-03-08 11:45:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:05,261 INFO L225 Difference]: With dead ends: 185 [2025-03-08 11:45:05,261 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 11:45:05,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 396 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:45:05,262 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 170 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:05,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 200 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:45:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 11:45:05,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-03-08 11:45:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 57 states have internal predecessors, (71), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:45:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2025-03-08 11:45:05,270 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 202 [2025-03-08 11:45:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:05,271 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2025-03-08 11:45:05,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-08 11:45:05,271 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2025-03-08 11:45:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:45:05,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:05,272 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:45:05,286 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 (5)] Ended with exit code 0 [2025-03-08 11:45:05,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-08 11:45:05,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:05,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:05,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1332196985, now seen corresponding path program 1 times [2025-03-08 11:45:05,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:45:05,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165563858] [2025-03-08 11:45:05,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:05,474 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-08 11:45:05,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:45:05,476 INFO L229 MonitoredProcess]: Starting monitored process 6 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-08 11:45:05,478 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 (6)] Waiting until timeout for monitored process [2025-03-08 11:45:05,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:45:05,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:45:05,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:05,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:05,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 11:45:05,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-08 11:45:06,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:45:06,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:45:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165563858] [2025-03-08 11:45:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165563858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:45:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [715271439] [2025-03-08 11:45:06,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:06,460 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 11:45:06,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 11:45:06,480 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 11:45:06,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-08 11:45:06,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:45:07,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:45:07,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:07,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:07,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 11:45:07,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1062 proven. 114 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-03-08 11:45:07,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:45:07,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [715271439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:45:07,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:45:07,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-08 11:45:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36947409] [2025-03-08 11:45:07,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:45:07,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:45:07,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:45:07,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:45:07,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:45:07,783 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-08 11:45:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:08,710 INFO L93 Difference]: Finished difference Result 195 states and 279 transitions. [2025-03-08 11:45:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:45:08,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 203 [2025-03-08 11:45:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:08,723 INFO L225 Difference]: With dead ends: 195 [2025-03-08 11:45:08,723 INFO L226 Difference]: Without dead ends: 106 [2025-03-08 11:45:08,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:45:08,724 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 53 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:08,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 261 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:45:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-08 11:45:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2025-03-08 11:45:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 11:45:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2025-03-08 11:45:08,736 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 203 [2025-03-08 11:45:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:08,736 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2025-03-08 11:45:08,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2025-03-08 11:45:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2025-03-08 11:45:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 11:45:08,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:08,738 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:45:08,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-08 11:45:08,948 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 (6)] Ended with exit code 0 [2025-03-08 11:45:09,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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-08 11:45:09,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:09,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2023065720, now seen corresponding path program 1 times [2025-03-08 11:45:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:45:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085193933] [2025-03-08 11:45:09,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:09,139 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-08 11:45:09,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:45:09,142 INFO L229 MonitoredProcess]: Starting monitored process 8 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-08 11:45:09,143 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 (8)] Waiting until timeout for monitored process [2025-03-08 11:45:09,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 11:45:09,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 11:45:09,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:09,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:09,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 11:45:09,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:10,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 969 proven. 177 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-03-08 11:45:10,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:45:10,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:45:10,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085193933] [2025-03-08 11:45:10,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085193933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:45:10,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [630583953] [2025-03-08 11:45:10,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:10,807 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 11:45:10,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 11:45:10,808 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 11:45:10,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-08 11:45:10,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 11:45:11,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 11:45:11,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:11,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:11,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 11:45:11,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:46:14,679 WARN L286 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)