./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-50.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2adacd4649b551fd532011cf99cda3c1fed229d8b4498a92bd6c1b105ba71c3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:21:00,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:21:01,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:21:01,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:21:01,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:21:01,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:21:01,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:21:01,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:21:01,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:21:01,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:21:01,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:21:01,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:21:01,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:21:01,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:21:01,071 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:21:01,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:21:01,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:21:01,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:21:01,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:21:01,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:21:01,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:21:01,073 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2adacd4649b551fd532011cf99cda3c1fed229d8b4498a92bd6c1b105ba71c3d [2025-03-16 23:21:01,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:21:01,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:21:01,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:21:01,313 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:21:01,313 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:21:01,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-50.i [2025-03-16 23:21:02,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334425b02/f1f50e4064b54f8990a8f871ea78b10c/FLAGfa00a1261 [2025-03-16 23:21:02,713 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:21:02,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-50.i [2025-03-16 23:21:02,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334425b02/f1f50e4064b54f8990a8f871ea78b10c/FLAGfa00a1261 [2025-03-16 23:21:03,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/334425b02/f1f50e4064b54f8990a8f871ea78b10c [2025-03-16 23:21:03,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:21:03,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:21:03,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:21:03,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:21:03,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:21:03,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03, skipping insertion in model container [2025-03-16 23:21:03,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:21:03,146 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_codestructure_steplocals_file-50.i[917,930] [2025-03-16 23:21:03,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:21:03,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:21:03,207 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_codestructure_steplocals_file-50.i[917,930] [2025-03-16 23:21:03,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:21:03,247 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:21:03,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03 WrapperNode [2025-03-16 23:21:03,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:21:03,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:21:03,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:21:03,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:21:03,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,296 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2025-03-16 23:21:03,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:21:03,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:21:03,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:21:03,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:21:03,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,328 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-16 23:21:03,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,340 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:21:03,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:21:03,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:21:03,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:21:03,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (1/1) ... [2025-03-16 23:21:03,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:21:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:21:03,375 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-16 23:21:03,377 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-16 23:21:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:21:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:21:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:21:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:21:03,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:21:03,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:21:03,463 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:21:03,465 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:21:03,788 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:21:03,789 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:21:03,798 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:21:03,798 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:21:03,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:21:03 BoogieIcfgContainer [2025-03-16 23:21:03,798 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:21:03,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:21:03,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:21:03,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:21:03,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:21:03" (1/3) ... [2025-03-16 23:21:03,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44295bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:21:03, skipping insertion in model container [2025-03-16 23:21:03,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:21:03" (2/3) ... [2025-03-16 23:21:03,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44295bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:21:03, skipping insertion in model container [2025-03-16 23:21:03,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:21:03" (3/3) ... [2025-03-16 23:21:03,806 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-50.i [2025-03-16 23:21:03,816 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:21:03,817 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-50.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:21:03,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:21:03,867 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;@2f3ba3ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:21:03,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:21:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-16 23:21:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 23:21:03,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:03,883 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:21:03,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:03,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:03,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1964052584, now seen corresponding path program 1 times [2025-03-16 23:21:03,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:21:03,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643319442] [2025-03-16 23:21:03,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:03,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:21:03,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:21:03,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:21:03,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-16 23:21:04,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:21:04,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643319442] [2025-03-16 23:21:04,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643319442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:21:04,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686816241] [2025-03-16 23:21:04,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:04,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:21:04,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:21:04,196 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-16 23:21:04,199 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-16 23:21:04,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:21:04,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:21:04,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:04,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:04,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:21:04,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:21:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2025-03-16 23:21:04,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:21:04,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686816241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:04,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:21:04,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:21:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087333331] [2025-03-16 23:21:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:04,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:21:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:21:04,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:21:04,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:21:04,445 INFO L87 Difference]: Start difference. First operand has 84 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-16 23:21:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:04,465 INFO L93 Difference]: Finished difference Result 165 states and 304 transitions. [2025-03-16 23:21:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:21:04,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 234 [2025-03-16 23:21:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:04,470 INFO L225 Difference]: With dead ends: 165 [2025-03-16 23:21:04,470 INFO L226 Difference]: Without dead ends: 82 [2025-03-16 23:21:04,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 235 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-16 23:21:04,474 INFO L435 NwaCegarLoop]: 129 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, 129 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-16 23:21:04,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:21:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-16 23:21:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-16 23:21:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-16 23:21:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2025-03-16 23:21:04,505 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 234 [2025-03-16 23:21:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:04,506 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2025-03-16 23:21:04,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (40), 2 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-16 23:21:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2025-03-16 23:21:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 23:21:04,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:04,511 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:21:04,520 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-16 23:21:04,712 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-16 23:21:04,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:04,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash -632595292, now seen corresponding path program 1 times [2025-03-16 23:21:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:21:04,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933132718] [2025-03-16 23:21:04,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:04,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:21:04,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:21:04,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:21:04,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:04,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 23:21:04,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:21:04,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933132718] [2025-03-16 23:21:04,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933132718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:04,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:21:04,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:21:04,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132313502] [2025-03-16 23:21:04,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:04,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:21:04,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:21:04,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:21:04,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:21:04,955 INFO L87 Difference]: Start difference. First operand 82 states and 129 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:21:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:05,012 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2025-03-16 23:21:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:21:05,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 234 [2025-03-16 23:21:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:05,016 INFO L225 Difference]: With dead ends: 196 [2025-03-16 23:21:05,016 INFO L226 Difference]: Without dead ends: 115 [2025-03-16 23:21:05,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:21:05,018 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 43 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:21:05,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 280 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:21:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-16 23:21:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2025-03-16 23:21:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 58 states have internal predecessors, (69), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-16 23:21:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-03-16 23:21:05,035 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 234 [2025-03-16 23:21:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:05,037 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-03-16 23:21:05,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:21:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-03-16 23:21:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 23:21:05,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:05,040 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:21:05,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:21:05,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:05,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash -603966141, now seen corresponding path program 1 times [2025-03-16 23:21:05,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:21:05,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767064166] [2025-03-16 23:21:05,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:05,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:21:05,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:21:05,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:21:05,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:05,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 23:21:05,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:21:05,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767064166] [2025-03-16 23:21:05,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767064166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:05,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:21:05,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:21:05,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623887258] [2025-03-16 23:21:05,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:05,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:21:05,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:21:05,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:21:05,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:21:05,380 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:21:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:05,428 INFO L93 Difference]: Finished difference Result 334 states and 517 transitions. [2025-03-16 23:21:05,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:21:05,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 234 [2025-03-16 23:21:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:05,432 INFO L225 Difference]: With dead ends: 334 [2025-03-16 23:21:05,432 INFO L226 Difference]: Without dead ends: 223 [2025-03-16 23:21:05,433 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-16 23:21:05,434 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 124 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:21:05,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 360 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:21:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-16 23:21:05,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2025-03-16 23:21:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 113 states have internal predecessors, (133), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-16 23:21:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 341 transitions. [2025-03-16 23:21:05,485 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 341 transitions. Word has length 234 [2025-03-16 23:21:05,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:05,485 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 341 transitions. [2025-03-16 23:21:05,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:21:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 341 transitions. [2025-03-16 23:21:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 23:21:05,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:05,491 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:21:05,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:21:05,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:05,492 INFO L85 PathProgramCache]: Analyzing trace with hash -800479646, now seen corresponding path program 1 times [2025-03-16 23:21:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:21:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246444415] [2025-03-16 23:21:05,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:21:05,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:21:05,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:21:05,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:05,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 23:21:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:21:27,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246444415] [2025-03-16 23:21:27,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246444415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:27,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:21:27,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:21:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867949199] [2025-03-16 23:21:27,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:27,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:21:27,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:21:27,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:21:27,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:21:27,563 INFO L87 Difference]: Start difference. First operand 220 states and 341 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:21:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:28,311 INFO L93 Difference]: Finished difference Result 259 states and 387 transitions. [2025-03-16 23:21:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:21:28,312 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 234 [2025-03-16 23:21:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:28,315 INFO L225 Difference]: With dead ends: 259 [2025-03-16 23:21:28,315 INFO L226 Difference]: Without dead ends: 257 [2025-03-16 23:21:28,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:21:28,316 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 54 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:21:28,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 516 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:21:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-16 23:21:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 229. [2025-03-16 23:21:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 120 states have (on average 1.2083333333333333) internal successors, (145), 122 states have internal predecessors, (145), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-16 23:21:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 353 transitions. [2025-03-16 23:21:28,348 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 353 transitions. Word has length 234 [2025-03-16 23:21:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:28,349 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 353 transitions. [2025-03-16 23:21:28,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:21:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 353 transitions. [2025-03-16 23:21:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 23:21:28,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:28,354 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:21:28,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:21:28,355 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:28,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash -800449855, now seen corresponding path program 1 times [2025-03-16 23:21:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:21:28,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941853521] [2025-03-16 23:21:28,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:21:28,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:21:28,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:21:28,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:28,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:21:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 23:21:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:21:46,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941853521] [2025-03-16 23:21:46,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941853521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:21:46,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:21:46,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:21:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849135972] [2025-03-16 23:21:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:21:46,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:21:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:21:46,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:21:46,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:21:46,267 INFO L87 Difference]: Start difference. First operand 229 states and 353 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:21:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:21:46,857 INFO L93 Difference]: Finished difference Result 257 states and 385 transitions. [2025-03-16 23:21:46,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:21:46,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 234 [2025-03-16 23:21:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:21:46,860 INFO L225 Difference]: With dead ends: 257 [2025-03-16 23:21:46,860 INFO L226 Difference]: Without dead ends: 255 [2025-03-16 23:21:46,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:21:46,861 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 23:21:46,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 531 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 23:21:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-16 23:21:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 229. [2025-03-16 23:21:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 120 states have (on average 1.2083333333333333) internal successors, (145), 122 states have internal predecessors, (145), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-16 23:21:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 353 transitions. [2025-03-16 23:21:46,881 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 353 transitions. Word has length 234 [2025-03-16 23:21:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:21:46,882 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 353 transitions. [2025-03-16 23:21:46,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:21:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 353 transitions. [2025-03-16 23:21:46,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 23:21:46,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:21:46,884 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:21:46,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:21:46,884 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:21:46,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:21:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash 87024035, now seen corresponding path program 1 times [2025-03-16 23:21:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:21:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30599249] [2025-03-16 23:21:46,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:21:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:21:46,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:21:46,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:21:46,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:21:46,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:22:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 23:22:05,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:22:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30599249] [2025-03-16 23:22:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30599249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:22:05,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:22:05,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:22:05,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6994605] [2025-03-16 23:22:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:22:05,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:22:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:22:05,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:22:05,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:22:05,128 INFO L87 Difference]: Start difference. First operand 229 states and 353 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:22:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:22:06,284 INFO L93 Difference]: Finished difference Result 256 states and 384 transitions. [2025-03-16 23:22:06,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:22:06,285 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 234 [2025-03-16 23:22:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:22:06,290 INFO L225 Difference]: With dead ends: 256 [2025-03-16 23:22:06,290 INFO L226 Difference]: Without dead ends: 254 [2025-03-16 23:22:06,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:22:06,291 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 38 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 23:22:06,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 511 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 23:22:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-16 23:22:06,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2025-03-16 23:22:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 125 states have internal predecessors, (149), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-16 23:22:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2025-03-16 23:22:06,312 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 234 [2025-03-16 23:22:06,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:22:06,314 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2025-03-16 23:22:06,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:22:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2025-03-16 23:22:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 23:22:06,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:22:06,316 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:22:06,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:22:06,316 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:22:06,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:22:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash 87053826, now seen corresponding path program 1 times [2025-03-16 23:22:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:22:06,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002582682] [2025-03-16 23:22:06,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:06,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:22:06,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:22:06,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:22:06,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:06,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:22:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 23:22:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:22:23,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002582682] [2025-03-16 23:22:23,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002582682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:22:23,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:22:23,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:22:23,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658824109] [2025-03-16 23:22:23,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:22:23,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:22:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:22:23,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:22:23,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:22:23,859 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:22:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:22:24,766 INFO L93 Difference]: Finished difference Result 261 states and 390 transitions. [2025-03-16 23:22:24,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:22:24,767 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 234 [2025-03-16 23:22:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:22:24,770 INFO L225 Difference]: With dead ends: 261 [2025-03-16 23:22:24,770 INFO L226 Difference]: Without dead ends: 259 [2025-03-16 23:22:24,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:22:24,770 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 39 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:22:24,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 618 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 23:22:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-16 23:22:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2025-03-16 23:22:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 120 states have (on average 1.2083333333333333) internal successors, (145), 122 states have internal predecessors, (145), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-16 23:22:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 353 transitions. [2025-03-16 23:22:24,791 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 353 transitions. Word has length 234 [2025-03-16 23:22:24,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:22:24,791 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 353 transitions. [2025-03-16 23:22:24,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 23:22:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 353 transitions. [2025-03-16 23:22:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 23:22:24,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:22:24,792 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:22:24,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:22:24,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:22:24,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:22:24,793 INFO L85 PathProgramCache]: Analyzing trace with hash 978345666, now seen corresponding path program 1 times [2025-03-16 23:22:24,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:22:24,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448025219] [2025-03-16 23:22:24,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:24,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:22:24,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:22:24,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:22:24,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:24,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:22:24,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [332570335] [2025-03-16 23:22:24,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:24,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:22:24,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:22:24,861 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-16 23:22:24,862 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-16 23:22:24,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:22:24,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:22:24,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:24,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:22:24,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:22:24,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:22:25,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:22:25,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:25,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:22:25,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:22:25,126 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:22:25,127 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:22:25,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 23:22:25,329 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,SelfDestructingSolverStorable7 [2025-03-16 23:22:25,331 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:22:25,442 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:22:25,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:22:25 BoogieIcfgContainer [2025-03-16 23:22:25,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:22:25,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:22:25,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:22:25,449 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:22:25,449 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:21:03" (3/4) ... [2025-03-16 23:22:25,451 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:22:25,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:22:25,453 INFO L158 Benchmark]: Toolchain (without parser) took 82407.33ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 107.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. [2025-03-16 23:22:25,453 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:22:25,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.08ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 93.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:22:25,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.25ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:22:25,453 INFO L158 Benchmark]: Boogie Preprocessor took 46.42ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 86.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:22:25,454 INFO L158 Benchmark]: IcfgBuilder took 454.14ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 63.5MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:22:25,454 INFO L158 Benchmark]: TraceAbstraction took 81647.09ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 62.5MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 148.1MB. Max. memory is 16.1GB. [2025-03-16 23:22:25,454 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 447.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:22:25,455 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.15ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.08ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 93.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.25ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 89.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.42ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 86.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 454.14ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 63.5MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 81647.09ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 62.5MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 148.1MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 447.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 127, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryArithmeticFLOAToperation at line 74, overapproximation of someUnaryFLOAToperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed long int var_1_2 = -16; [L24] signed long int var_1_3 = 4; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 256; [L27] signed long int var_1_6 = 32; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] signed short int var_1_9 = -2; [L31] signed short int var_1_10 = -1; [L32] signed short int var_1_11 = 4; [L33] signed short int var_1_12 = -10; [L34] float var_1_13 = 999.4; [L35] float var_1_14 = 100.425; [L36] float var_1_15 = 3.375; [L37] float var_1_16 = 15.9; [L38] signed short int var_1_17 = -10; [L39] signed short int var_1_18 = 18060; [L40] signed short int var_1_19 = 128; [L41] unsigned char var_1_20 = 0; [L42] unsigned long int var_1_21 = 4; [L43] unsigned long int var_1_22 = 0; [L44] unsigned char var_1_23 = 0; [L45] unsigned char var_1_24 = 0; [L46] unsigned char var_1_25 = 100; [L47] unsigned char var_1_26 = 32; [L48] unsigned char var_1_27 = 10; [L49] unsigned char var_1_28 = 1; [L50] unsigned short int var_1_29 = 256; [L51] unsigned char var_1_30 = 1; [L165] isInitial = 1 [L166] FCALL initially() [L167] COND TRUE 1 [L168] FCALL updateLastVariables() [L169] CALL updateVariables() [L96] var_1_2 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=4, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=4, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L97] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=4, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L98] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=4, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=4, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L98] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=4, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L99] var_1_3 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L100] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L101] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L101] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=0, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L102] var_1_4 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L103] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L104] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L104] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=256, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L105] var_1_5 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L106] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L107] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L107] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=0, var_1_8=1, var_1_9=-2] [L108] var_1_6 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=-2] [L109] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=-2] [L110] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=-2] [L110] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=-2] [L111] var_1_7 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L112] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L113] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L113] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L114] var_1_8 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L115] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L116] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L116] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L117] var_1_10 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L118] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L119] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L119] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=-32767, var_1_11=4, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L120] var_1_11 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L121] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L122] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L122] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=-10, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L123] var_1_12 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_12 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L124] RET assume_abort_if_not(var_1_12 >= -32767) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L125] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L125] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L126] var_1_14 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] var_1_15 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] var_1_16 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_18 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=128, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] var_1_19 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=4, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_21 = __VERIFIER_nondet_ulong() [L139] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] var_1_22 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L169] RET updateVariables() [L170] CALL step() [L55] signed long int stepLocal_1 = (((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)); [L56] signed long int stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=-1, stepLocal_1=-1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=1, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L57] COND FALSE !(stepLocal_1 <= (var_1_5 - var_1_6)) [L66] var_1_1 = 0 VAL [isInitial=1, stepLocal_0=-1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=0, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=-2] [L68] COND FALSE !((var_1_6 > var_1_3) && var_1_1) [L71] var_1_9 = ((((var_1_10) > ((((((var_1_11 - 10)) < (var_1_12)) ? ((var_1_11 - 10)) : (var_1_12))))) ? (var_1_10) : ((((((var_1_11 - 10)) < (var_1_12)) ? ((var_1_11 - 10)) : (var_1_12)))))) VAL [isInitial=1, stepLocal_0=-1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=0, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L73] COND TRUE \read(var_1_8) [L74] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, stepLocal_0=-1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_19=16357, var_1_1=0, var_1_20=0, var_1_21=16383, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] var_1_17 = ((var_1_18 - 25) - var_1_19) [L77] unsigned long int stepLocal_2 = var_1_22 + var_1_3; VAL [isInitial=1, stepLocal_0=-1, stepLocal_2=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=2, var_1_16=0, var_1_17=0, var_1_18=16382, var_1_19=16357, var_1_1=0, var_1_20=0, var_1_21=16383, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L78] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L79] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, stepLocal_0=-1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=2, var_1_16=0, var_1_17=0, var_1_18=16382, var_1_19=16357, var_1_1=0, var_1_20=0, var_1_21=16383, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L83] COND TRUE \read(var_1_8) [L84] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, stepLocal_0=-1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=2, var_1_16=0, var_1_17=0, var_1_18=16382, var_1_19=16357, var_1_1=0, var_1_20=0, var_1_21=16383, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L86] signed long int stepLocal_3 = ~ var_1_5; VAL [isInitial=1, stepLocal_0=-1, stepLocal_3=0, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=2, var_1_16=0, var_1_17=0, var_1_18=16382, var_1_19=16357, var_1_1=0, var_1_20=0, var_1_21=16383, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=1, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L87] COND TRUE stepLocal_3 > var_1_3 [L88] var_1_28 = (! var_1_7) VAL [isInitial=1, stepLocal_0=-1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=2, var_1_16=0, var_1_17=0, var_1_18=16382, var_1_19=16357, var_1_1=0, var_1_20=0, var_1_21=16383, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=256, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L92] var_1_29 = var_1_27 [L93] var_1_30 = var_1_8 [L170] RET step() [L171] CALL, EXPR property() [L161-L162] return (((((((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) <= (var_1_5 - var_1_6)) ? ((var_1_5 < var_1_6) ? (var_1_4 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_6 > var_1_3) && var_1_1) ? (var_1_9 == ((signed short int) var_1_10)) : (var_1_9 == ((signed short int) ((((var_1_10) > ((((((var_1_11 - 10)) < (var_1_12)) ? ((var_1_11 - 10)) : (var_1_12))))) ? (var_1_10) : ((((((var_1_11 - 10)) < (var_1_12)) ? ((var_1_11 - 10)) : (var_1_12)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_19)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_22 + var_1_3)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_5) > var_1_3) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; [L171] RET, EXPR property() [L171] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=2, var_1_16=0, var_1_17=0, var_1_18=16382, var_1_19=16357, var_1_1=0, var_1_20=0, var_1_21=16383, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=127, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-32767, var_1_11=10, var_1_12=0, var_1_13=2, var_1_16=0, var_1_17=0, var_1_18=16382, var_1_19=16357, var_1_1=0, var_1_20=0, var_1_21=16383, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=127, var_1_28=0, var_1_29=127, var_1_2=-1, var_1_30=1, var_1_3=-1, var_1_4=1, var_1_5=-1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 173 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 81.5s, OverallIterations: 8, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 2945 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1943 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 942 IncrementalHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1002 mSDtfsCounter, 942 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 112 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 76.1s InterpolantComputationTime, 2340 NumberOfCodeBlocks, 2340 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1864 ConstructedInterpolants, 0 QuantifiedInterpolants, 17702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 24882/24960 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-16 23:22:25,670 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-16 23:22:25,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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_codestructure_steplocals_file-50.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2adacd4649b551fd532011cf99cda3c1fed229d8b4498a92bd6c1b105ba71c3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:22:27,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:22:27,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:22:27,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:22:27,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:22:27,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:22:27,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:22:27,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:22:27,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:22:27,601 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:22:27,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:22:27,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:22:27,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:22:27,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:22:27,601 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:22:27,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:22:27,602 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:22:27,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:22:27,603 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:22:27,603 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:22:27,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:22:27,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:22:27,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:22:27,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:22:27,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:22:27,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:22:27,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:22:27,603 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:22:27,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:22:27,604 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:22:27,604 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:22:27,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:22:27,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:22:27,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:22:27,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:22:27,604 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 -> 2adacd4649b551fd532011cf99cda3c1fed229d8b4498a92bd6c1b105ba71c3d [2025-03-16 23:22:27,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:22:27,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:22:27,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:22:27,867 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:22:27,867 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:22:27,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-50.i [2025-03-16 23:22:29,075 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06912f538/755bdacff282419e8e848a5896819983/FLAGb4334db66 [2025-03-16 23:22:29,320 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:22:29,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-50.i [2025-03-16 23:22:29,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06912f538/755bdacff282419e8e848a5896819983/FLAGb4334db66 [2025-03-16 23:22:29,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06912f538/755bdacff282419e8e848a5896819983 [2025-03-16 23:22:29,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:22:29,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:22:29,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:22:29,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:22:29,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:22:29,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:29,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c8568b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29, skipping insertion in model container [2025-03-16 23:22:29,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:29,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:22:29,802 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_codestructure_steplocals_file-50.i[917,930] [2025-03-16 23:22:29,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:22:29,855 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:22:29,864 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_codestructure_steplocals_file-50.i[917,930] [2025-03-16 23:22:29,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:22:29,905 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:22:29,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29 WrapperNode [2025-03-16 23:22:29,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:22:29,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:22:29,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:22:29,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:22:29,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:29,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:29,955 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-03-16 23:22:29,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:22:29,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:22:29,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:22:29,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:22:29,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:29,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:29,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:29,986 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-16 23:22:29,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:29,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:29,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:29,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:30,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:30,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:30,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:22:30,010 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:22:30,010 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:22:30,010 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:22:30,011 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (1/1) ... [2025-03-16 23:22:30,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:22:30,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:22:30,054 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-16 23:22:30,057 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-16 23:22:30,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:22:30,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:22:30,076 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:22:30,076 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:22:30,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:22:30,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:22:30,151 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:22:30,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:22:30,601 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:22:30,601 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:22:30,608 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:22:30,608 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:22:30,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:22:30 BoogieIcfgContainer [2025-03-16 23:22:30,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:22:30,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:22:30,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:22:30,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:22:30,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:22:29" (1/3) ... [2025-03-16 23:22:30,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfeb5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:22:30, skipping insertion in model container [2025-03-16 23:22:30,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:22:29" (2/3) ... [2025-03-16 23:22:30,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dfeb5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:22:30, skipping insertion in model container [2025-03-16 23:22:30,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:22:30" (3/3) ... [2025-03-16 23:22:30,619 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-50.i [2025-03-16 23:22:30,629 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:22:30,630 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-50.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:22:30,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:22:30,683 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;@35228ee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:22:30,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:22:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-16 23:22:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 23:22:30,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:22:30,699 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:22:30,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:22:30,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:22:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1964052584, now seen corresponding path program 1 times [2025-03-16 23:22:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:22:30,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64773522] [2025-03-16 23:22:30,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:30,712 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-16 23:22:30,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:22:30,714 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-16 23:22:30,716 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-16 23:22:30,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-16 23:22:31,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-16 23:22:31,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:22:31,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:22:31,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:22:31,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:22:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1374 proven. 0 refuted. 0 times theorem prover too weak. 1746 trivial. 0 not checked. [2025-03-16 23:22:31,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:22:31,085 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:22:31,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64773522] [2025-03-16 23:22:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64773522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:22:31,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:22:31,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:22:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919699595] [2025-03-16 23:22:31,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:22:31,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:22:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:22:31,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:22:31,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:22:31,106 INFO L87 Difference]: Start difference. First operand has 84 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-16 23:22:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:22:31,128 INFO L93 Difference]: Finished difference Result 165 states and 304 transitions. [2025-03-16 23:22:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:22:31,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 234 [2025-03-16 23:22:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:22:31,137 INFO L225 Difference]: With dead ends: 165 [2025-03-16 23:22:31,138 INFO L226 Difference]: Without dead ends: 82 [2025-03-16 23:22:31,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 233 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-16 23:22:31,145 INFO L435 NwaCegarLoop]: 129 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, 129 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-16 23:22:31,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:22:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-16 23:22:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-16 23:22:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-16 23:22:31,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2025-03-16 23:22:31,185 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 234 [2025-03-16 23:22:31,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:22:31,186 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2025-03-16 23:22:31,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-03-16 23:22:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2025-03-16 23:22:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-16 23:22:31,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:22:31,190 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:22:31,200 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-16 23:22:31,391 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-16 23:22:31,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:22:31,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:22:31,392 INFO L85 PathProgramCache]: Analyzing trace with hash -632595292, now seen corresponding path program 1 times [2025-03-16 23:22:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:22:31,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953504502] [2025-03-16 23:22:31,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:22:31,394 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-16 23:22:31,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:22:31,398 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-16 23:22:31,399 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-16 23:22:31,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes.