./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.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 2488085725fecf3e41843357112538a95cf6d7d4f37e4c2a3a245a1de1fa0759 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:33:07,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:33:08,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:33:08,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:33:08,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:33:08,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:33:08,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:33:08,041 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:33:08,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:33:08,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:33:08,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:33:08,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:33:08,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:33:08,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:33:08,043 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:33:08,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:33:08,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:33:08,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:33:08,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:33:08,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:33:08,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:33:08,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:33:08,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:33:08,046 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 -> 2488085725fecf3e41843357112538a95cf6d7d4f37e4c2a3a245a1de1fa0759 [2025-03-08 11:33:08,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:33:08,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:33:08,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:33:08,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:33:08,291 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:33:08,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i [2025-03-08 11:33:09,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3798cf088/c03b2e38678c44f0b02fd00a32657074/FLAG099f7f5b1 [2025-03-08 11:33:09,699 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:33:09,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i [2025-03-08 11:33:09,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3798cf088/c03b2e38678c44f0b02fd00a32657074/FLAG099f7f5b1 [2025-03-08 11:33:09,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3798cf088/c03b2e38678c44f0b02fd00a32657074 [2025-03-08 11:33:09,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:33:09,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:33:09,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:33:09,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:33:09,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:33:09,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:33:09" (1/1) ... [2025-03-08 11:33:09,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c93915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:09, skipping insertion in model container [2025-03-08 11:33:09,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:33:09" (1/1) ... [2025-03-08 11:33:10,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:33:10,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i[915,928] [2025-03-08 11:33:10,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:33:10,168 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:33:10,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i[915,928] [2025-03-08 11:33:10,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:33:10,220 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:33:10,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10 WrapperNode [2025-03-08 11:33:10,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:33:10,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:33:10,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:33:10,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:33:10,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,270 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 283 [2025-03-08 11:33:10,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:33:10,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:33:10,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:33:10,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:33:10,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,308 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:33:10,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:33:10,346 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:33:10,346 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:33:10,346 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:33:10,347 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (1/1) ... [2025-03-08 11:33:10,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:33:10,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:33:10,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:33:10,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:33:10,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:33:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:33:10,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:33:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:33:10,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:33:10,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:33:10,461 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:33:10,462 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:33:10,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L191: havoc property_#t~bitwise27#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-03-08 11:33:10,886 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 11:33:10,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:33:10,916 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:33:10,918 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:33:10,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:33:10 BoogieIcfgContainer [2025-03-08 11:33:10,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:33:10,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:33:10,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:33:10,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:33:10,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:33:09" (1/3) ... [2025-03-08 11:33:10,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f00c926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:33:10, skipping insertion in model container [2025-03-08 11:33:10,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:10" (2/3) ... [2025-03-08 11:33:10,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f00c926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:33:10, skipping insertion in model container [2025-03-08 11:33:10,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:33:10" (3/3) ... [2025-03-08 11:33:10,925 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-78.i [2025-03-08 11:33:10,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:33:10,937 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-78.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:33:11,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:33:11,013 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;@5d69ca35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:33:11,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:33:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:33:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 11:33:11,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:11,030 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:11,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:11,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:11,034 INFO L85 PathProgramCache]: Analyzing trace with hash -636967530, now seen corresponding path program 1 times [2025-03-08 11:33:11,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:11,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881994723] [2025-03-08 11:33:11,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:11,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:11,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 11:33:11,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 11:33:11,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:11,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-08 11:33:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881994723] [2025-03-08 11:33:11,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881994723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:33:11,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762175458] [2025-03-08 11:33:11,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:11,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:33:11,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:33:11,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:33:11,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:33:11,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 11:33:11,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 11:33:11,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:11,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:11,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:33:11,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:33:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-08 11:33:11,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:33:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762175458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:11,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:33:11,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:33:11,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292362579] [2025-03-08 11:33:11,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:33:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:11,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:33:11,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:33:11,610 INFO L87 Difference]: Start difference. First operand has 120 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 11:33:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:11,642 INFO L93 Difference]: Finished difference Result 234 states and 407 transitions. [2025-03-08 11:33:11,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:33:11,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 220 [2025-03-08 11:33:11,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:11,649 INFO L225 Difference]: With dead ends: 234 [2025-03-08 11:33:11,649 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 11:33:11,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:33:11,653 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:11,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:33:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 11:33:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-08 11:33:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:33:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 184 transitions. [2025-03-08 11:33:11,694 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 184 transitions. Word has length 220 [2025-03-08 11:33:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:11,694 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 184 transitions. [2025-03-08 11:33:11,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 11:33:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 184 transitions. [2025-03-08 11:33:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 11:33:11,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:11,698 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:11,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:33:11,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:33:11,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:11,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1097878372, now seen corresponding path program 1 times [2025-03-08 11:33:11,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:11,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917186397] [2025-03-08 11:33:11,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:11,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 11:33:11,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 11:33:11,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:11,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:12,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:12,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917186397] [2025-03-08 11:33:12,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917186397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:12,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:12,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:33:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956001897] [2025-03-08 11:33:12,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:12,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:33:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:12,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:33:12,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:33:12,281 INFO L87 Difference]: Start difference. First operand 117 states and 184 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:12,337 INFO L93 Difference]: Finished difference Result 231 states and 365 transitions. [2025-03-08 11:33:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:33:12,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2025-03-08 11:33:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:12,340 INFO L225 Difference]: With dead ends: 231 [2025-03-08 11:33:12,340 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 11:33:12,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:33:12,341 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:12,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 518 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:33:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 11:33:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-08 11:33:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:33:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2025-03-08 11:33:12,359 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 220 [2025-03-08 11:33:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:12,360 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2025-03-08 11:33:12,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2025-03-08 11:33:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-08 11:33:12,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:12,363 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:12,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:33:12,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:12,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1720900241, now seen corresponding path program 1 times [2025-03-08 11:33:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:12,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240011814] [2025-03-08 11:33:12,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:12,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 11:33:12,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 11:33:12,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:12,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:12,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240011814] [2025-03-08 11:33:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240011814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:12,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:12,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:33:12,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948367763] [2025-03-08 11:33:12,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:12,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:33:12,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:12,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:33:12,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:33:12,670 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:12,905 INFO L93 Difference]: Finished difference Result 346 states and 544 transitions. [2025-03-08 11:33:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:33:12,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221 [2025-03-08 11:33:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:12,909 INFO L225 Difference]: With dead ends: 346 [2025-03-08 11:33:12,911 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 11:33:12,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:33:12,914 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 152 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:12,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 493 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:33:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 11:33:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 215. [2025-03-08 11:33:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 144 states have (on average 1.4166666666666667) internal successors, (204), 144 states have internal predecessors, (204), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:33:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 340 transitions. [2025-03-08 11:33:12,951 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 340 transitions. Word has length 221 [2025-03-08 11:33:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:12,952 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 340 transitions. [2025-03-08 11:33:12,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 340 transitions. [2025-03-08 11:33:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-08 11:33:12,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:12,954 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:12,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:33:12,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:12,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:12,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1457054691, now seen corresponding path program 1 times [2025-03-08 11:33:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501364729] [2025-03-08 11:33:12,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:12,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 11:33:12,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 11:33:12,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:12,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:13,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:13,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501364729] [2025-03-08 11:33:13,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501364729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:13,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:13,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:33:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90985932] [2025-03-08 11:33:13,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:13,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:33:13,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:13,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:33:13,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:33:13,202 INFO L87 Difference]: Start difference. First operand 215 states and 340 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:13,398 INFO L93 Difference]: Finished difference Result 481 states and 754 transitions. [2025-03-08 11:33:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:33:13,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2025-03-08 11:33:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:13,402 INFO L225 Difference]: With dead ends: 481 [2025-03-08 11:33:13,402 INFO L226 Difference]: Without dead ends: 352 [2025-03-08 11:33:13,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:33:13,403 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 190 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:13,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 519 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:33:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-08 11:33:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2025-03-08 11:33:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 228 states have (on average 1.412280701754386) internal successors, (322), 228 states have internal predecessors, (322), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:33:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 526 transitions. [2025-03-08 11:33:13,447 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 526 transitions. Word has length 222 [2025-03-08 11:33:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:13,448 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 526 transitions. [2025-03-08 11:33:13,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 526 transitions. [2025-03-08 11:33:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 11:33:13,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:13,450 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:13,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:33:13,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:13,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1735318674, now seen corresponding path program 1 times [2025-03-08 11:33:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:13,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315445577] [2025-03-08 11:33:13,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:13,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 11:33:13,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 11:33:13,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:13,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:13,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:13,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315445577] [2025-03-08 11:33:13,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315445577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:13,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:13,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:33:13,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167549498] [2025-03-08 11:33:13,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:13,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:33:13,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:13,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:33:13,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:33:13,797 INFO L87 Difference]: Start difference. First operand 334 states and 526 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:14,145 INFO L93 Difference]: Finished difference Result 883 states and 1373 transitions. [2025-03-08 11:33:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 11:33:14,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-03-08 11:33:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:14,149 INFO L225 Difference]: With dead ends: 883 [2025-03-08 11:33:14,149 INFO L226 Difference]: Without dead ends: 646 [2025-03-08 11:33:14,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:33:14,151 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 407 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:14,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1400 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:33:14,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-03-08 11:33:14,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 580. [2025-03-08 11:33:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 404 states have (on average 1.4207920792079207) internal successors, (574), 404 states have internal predecessors, (574), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-08 11:33:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 914 transitions. [2025-03-08 11:33:14,212 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 914 transitions. Word has length 223 [2025-03-08 11:33:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:14,213 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 914 transitions. [2025-03-08 11:33:14,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:14,213 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 914 transitions. [2025-03-08 11:33:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 11:33:14,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:14,217 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:14,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:33:14,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:14,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1931832179, now seen corresponding path program 1 times [2025-03-08 11:33:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:14,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9866404] [2025-03-08 11:33:14,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:14,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 11:33:14,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 11:33:14,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:14,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:14,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:14,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9866404] [2025-03-08 11:33:14,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9866404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:14,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:14,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:33:14,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788445398] [2025-03-08 11:33:14,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:14,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:33:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:14,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:33:14,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:33:14,540 INFO L87 Difference]: Start difference. First operand 580 states and 914 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:14,773 INFO L93 Difference]: Finished difference Result 1136 states and 1773 transitions. [2025-03-08 11:33:14,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:33:14,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-03-08 11:33:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:14,788 INFO L225 Difference]: With dead ends: 1136 [2025-03-08 11:33:14,788 INFO L226 Difference]: Without dead ends: 642 [2025-03-08 11:33:14,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:33:14,790 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 144 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:14,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 493 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:33:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-08 11:33:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 588. [2025-03-08 11:33:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 412 states have (on average 1.4101941747572815) internal successors, (581), 412 states have internal predecessors, (581), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-08 11:33:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 921 transitions. [2025-03-08 11:33:14,858 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 921 transitions. Word has length 223 [2025-03-08 11:33:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:14,860 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 921 transitions. [2025-03-08 11:33:14,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 921 transitions. [2025-03-08 11:33:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 11:33:14,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:14,862 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:14,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:33:14,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:14,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash 493387948, now seen corresponding path program 1 times [2025-03-08 11:33:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:14,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092200981] [2025-03-08 11:33:14,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:14,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 11:33:14,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 11:33:14,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:14,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:15,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:15,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092200981] [2025-03-08 11:33:15,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092200981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:15,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:15,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:33:15,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016842036] [2025-03-08 11:33:15,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:15,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:33:15,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:15,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:33:15,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:33:15,136 INFO L87 Difference]: Start difference. First operand 588 states and 921 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:15,454 INFO L93 Difference]: Finished difference Result 1421 states and 2210 transitions. [2025-03-08 11:33:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:33:15,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-03-08 11:33:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:15,472 INFO L225 Difference]: With dead ends: 1421 [2025-03-08 11:33:15,474 INFO L226 Difference]: Without dead ends: 915 [2025-03-08 11:33:15,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:33:15,476 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 195 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:15,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 680 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:33:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-08 11:33:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 827. [2025-03-08 11:33:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 581 states have (on average 1.4079173838209982) internal successors, (818), 581 states have internal predecessors, (818), 238 states have call successors, (238), 7 states have call predecessors, (238), 7 states have return successors, (238), 238 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 11:33:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1294 transitions. [2025-03-08 11:33:15,553 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1294 transitions. Word has length 224 [2025-03-08 11:33:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:15,555 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1294 transitions. [2025-03-08 11:33:15,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1294 transitions. [2025-03-08 11:33:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 11:33:15,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:15,557 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:15,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:33:15,557 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1544668341, now seen corresponding path program 1 times [2025-03-08 11:33:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290130844] [2025-03-08 11:33:15,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:15,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 11:33:15,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 11:33:15,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:15,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:15,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:15,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290130844] [2025-03-08 11:33:15,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290130844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:15,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:15,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:33:15,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560645260] [2025-03-08 11:33:15,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:15,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:33:15,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:15,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:33:15,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:33:15,783 INFO L87 Difference]: Start difference. First operand 827 states and 1294 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:15,916 INFO L93 Difference]: Finished difference Result 1663 states and 2600 transitions. [2025-03-08 11:33:15,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:33:15,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-03-08 11:33:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:15,921 INFO L225 Difference]: With dead ends: 1663 [2025-03-08 11:33:15,922 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 11:33:15,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:33:15,924 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 71 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:15,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 690 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:33:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 11:33:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 905. [2025-03-08 11:33:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 659 states have (on average 1.4036418816388467) internal successors, (925), 659 states have internal predecessors, (925), 238 states have call successors, (238), 7 states have call predecessors, (238), 7 states have return successors, (238), 238 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 11:33:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1401 transitions. [2025-03-08 11:33:15,984 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1401 transitions. Word has length 224 [2025-03-08 11:33:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:15,984 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1401 transitions. [2025-03-08 11:33:15,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1401 transitions. [2025-03-08 11:33:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-08 11:33:15,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:15,986 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:15,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:33:15,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1637732724, now seen corresponding path program 1 times [2025-03-08 11:33:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:15,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302345409] [2025-03-08 11:33:15,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:15,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:15,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 11:33:16,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 11:33:16,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:16,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 33 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 11:33:16,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:16,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302345409] [2025-03-08 11:33:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302345409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:33:16,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824263458] [2025-03-08 11:33:16,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:16,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:33:16,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:33:16,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:33:16,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:33:16,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 11:33:16,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 11:33:16,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:16,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:16,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:33:16,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:33:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1045 proven. 33 refuted. 0 times theorem prover too weak. 1166 trivial. 0 not checked. [2025-03-08 11:33:16,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:33:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 33 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 11:33:16,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824263458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:33:16,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:33:16,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 11:33:16,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437271720] [2025-03-08 11:33:16,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:33:16,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:33:16,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:16,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:33:16,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:33:16,653 INFO L87 Difference]: Start difference. First operand 905 states and 1401 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2025-03-08 11:33:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:16,928 INFO L93 Difference]: Finished difference Result 1786 states and 2734 transitions. [2025-03-08 11:33:16,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:33:16,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 229 [2025-03-08 11:33:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:16,934 INFO L225 Difference]: With dead ends: 1786 [2025-03-08 11:33:16,935 INFO L226 Difference]: Without dead ends: 947 [2025-03-08 11:33:16,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:33:16,938 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 219 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:16,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 317 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:33:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-08 11:33:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 933. [2025-03-08 11:33:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 680 states have (on average 1.35) internal successors, (918), 680 states have internal predecessors, (918), 238 states have call successors, (238), 14 states have call predecessors, (238), 14 states have return successors, (238), 238 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 11:33:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1394 transitions. [2025-03-08 11:33:17,018 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1394 transitions. Word has length 229 [2025-03-08 11:33:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:17,018 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1394 transitions. [2025-03-08 11:33:17,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2025-03-08 11:33:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1394 transitions. [2025-03-08 11:33:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-08 11:33:17,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:17,021 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:17,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:33:17,221 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,SelfDestructingSolverStorable8 [2025-03-08 11:33:17,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:17,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:17,222 INFO L85 PathProgramCache]: Analyzing trace with hash -239707447, now seen corresponding path program 1 times [2025-03-08 11:33:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:17,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238595187] [2025-03-08 11:33:17,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:17,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:17,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 11:33:17,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 11:33:17,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:17,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:17,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:17,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238595187] [2025-03-08 11:33:17,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238595187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:17,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:33:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725922658] [2025-03-08 11:33:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:17,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:33:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:17,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:33:17,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:33:17,296 INFO L87 Difference]: Start difference. First operand 933 states and 1394 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:17,387 INFO L93 Difference]: Finished difference Result 2523 states and 3749 transitions. [2025-03-08 11:33:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:33:17,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 232 [2025-03-08 11:33:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:17,396 INFO L225 Difference]: With dead ends: 2523 [2025-03-08 11:33:17,397 INFO L226 Difference]: Without dead ends: 1665 [2025-03-08 11:33:17,399 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-08 11:33:17,400 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 142 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:17,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 383 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:33:17,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-08 11:33:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1657. [2025-03-08 11:33:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1247 states have (on average 1.3480352846832397) internal successors, (1681), 1253 states have internal predecessors, (1681), 382 states have call successors, (382), 27 states have call predecessors, (382), 27 states have return successors, (382), 376 states have call predecessors, (382), 382 states have call successors, (382) [2025-03-08 11:33:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2445 transitions. [2025-03-08 11:33:17,518 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2445 transitions. Word has length 232 [2025-03-08 11:33:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:17,519 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2445 transitions. [2025-03-08 11:33:17,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2445 transitions. [2025-03-08 11:33:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-08 11:33:17,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:17,522 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:17,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:33:17,522 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:17,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 90058314, now seen corresponding path program 1 times [2025-03-08 11:33:17,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:17,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965881464] [2025-03-08 11:33:17,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:17,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:17,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 11:33:17,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 11:33:17,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:17,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 72 proven. 27 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 11:33:17,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:17,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965881464] [2025-03-08 11:33:17,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965881464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:33:17,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086997972] [2025-03-08 11:33:17,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:17,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:33:17,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:33:17,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:33:17,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:33:17,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 11:33:17,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 11:33:17,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:17,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:17,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:33:17,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:33:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 945 proven. 27 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2025-03-08 11:33:17,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:33:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 72 proven. 27 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 11:33:18,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086997972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:33:18,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:33:18,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 11:33:18,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697961919] [2025-03-08 11:33:18,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:33:18,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:33:18,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:18,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:33:18,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:33:18,061 INFO L87 Difference]: Start difference. First operand 1657 states and 2445 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-03-08 11:33:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:18,281 INFO L93 Difference]: Finished difference Result 2598 states and 3786 transitions. [2025-03-08 11:33:18,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:33:18,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 232 [2025-03-08 11:33:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:18,288 INFO L225 Difference]: With dead ends: 2598 [2025-03-08 11:33:18,288 INFO L226 Difference]: Without dead ends: 1017 [2025-03-08 11:33:18,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:33:18,292 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 121 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:18,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 308 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:33:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-03-08 11:33:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 989. [2025-03-08 11:33:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 722 states have (on average 1.290858725761773) internal successors, (932), 722 states have internal predecessors, (932), 238 states have call successors, (238), 28 states have call predecessors, (238), 28 states have return successors, (238), 238 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-08 11:33:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1408 transitions. [2025-03-08 11:33:18,365 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1408 transitions. Word has length 232 [2025-03-08 11:33:18,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:18,366 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1408 transitions. [2025-03-08 11:33:18,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-03-08 11:33:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1408 transitions. [2025-03-08 11:33:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 11:33:18,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:18,368 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:18,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 11:33:18,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:33:18,569 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:18,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash -703877108, now seen corresponding path program 1 times [2025-03-08 11:33:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866787255] [2025-03-08 11:33:18,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:18,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 11:33:18,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 11:33:18,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:18,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866787255] [2025-03-08 11:33:18,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866787255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:18,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:33:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052137503] [2025-03-08 11:33:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:33:18,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:18,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:33:18,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:33:18,664 INFO L87 Difference]: Start difference. First operand 989 states and 1408 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:18,757 INFO L93 Difference]: Finished difference Result 2544 states and 3653 transitions. [2025-03-08 11:33:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:33:18,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 234 [2025-03-08 11:33:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:18,766 INFO L225 Difference]: With dead ends: 2544 [2025-03-08 11:33:18,766 INFO L226 Difference]: Without dead ends: 1647 [2025-03-08 11:33:18,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:33:18,769 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 122 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:18,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 485 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:33:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-03-08 11:33:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1639. [2025-03-08 11:33:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1245 states have (on average 1.3204819277108433) internal successors, (1644), 1251 states have internal predecessors, (1644), 358 states have call successors, (358), 35 states have call predecessors, (358), 35 states have return successors, (358), 352 states have call predecessors, (358), 358 states have call successors, (358) [2025-03-08 11:33:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2360 transitions. [2025-03-08 11:33:18,871 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2360 transitions. Word has length 234 [2025-03-08 11:33:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:18,871 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2360 transitions. [2025-03-08 11:33:18,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2360 transitions. [2025-03-08 11:33:18,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 11:33:18,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:18,873 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:18,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:33:18,874 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:18,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash -10775411, now seen corresponding path program 1 times [2025-03-08 11:33:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426385385] [2025-03-08 11:33:18,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:18,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 11:33:18,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 11:33:18,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:18,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:33:18,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777277011] [2025-03-08 11:33:18,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:18,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:33:18,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:33:18,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:33:18,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 11:33:19,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 11:33:19,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 11:33:19,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:19,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:19,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 11:33:19,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:33:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 399 proven. 90 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2025-03-08 11:33:19,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:33:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:20,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426385385] [2025-03-08 11:33:20,444 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 11:33:20,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777277011] [2025-03-08 11:33:20,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777277011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:33:20,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:33:20,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-08 11:33:20,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120700889] [2025-03-08 11:33:20,444 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 11:33:20,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:33:20,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:20,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:33:20,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:33:20,445 INFO L87 Difference]: Start difference. First operand 1639 states and 2360 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 11:33:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:21,057 INFO L93 Difference]: Finished difference Result 3887 states and 5523 transitions. [2025-03-08 11:33:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:33:21,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 234 [2025-03-08 11:33:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:21,072 INFO L225 Difference]: With dead ends: 3887 [2025-03-08 11:33:21,073 INFO L226 Difference]: Without dead ends: 2855 [2025-03-08 11:33:21,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-03-08 11:33:21,078 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 119 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:21,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 794 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:33:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2025-03-08 11:33:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2759. [2025-03-08 11:33:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2759 states, 2091 states have (on average 1.3084648493543758) internal successors, (2736), 2109 states have internal predecessors, (2736), 590 states have call successors, (590), 77 states have call predecessors, (590), 77 states have return successors, (590), 572 states have call predecessors, (590), 590 states have call successors, (590) [2025-03-08 11:33:21,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 3916 transitions. [2025-03-08 11:33:21,236 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 3916 transitions. Word has length 234 [2025-03-08 11:33:21,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:21,237 INFO L471 AbstractCegarLoop]: Abstraction has 2759 states and 3916 transitions. [2025-03-08 11:33:21,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 11:33:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3916 transitions. [2025-03-08 11:33:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 11:33:21,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:21,239 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:21,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 11:33:21,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:33:21,443 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:21,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:21,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1927151445, now seen corresponding path program 1 times [2025-03-08 11:33:21,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:21,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337901680] [2025-03-08 11:33:21,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:21,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:21,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 11:33:21,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 11:33:21,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:21,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:21,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:33:21,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337901680] [2025-03-08 11:33:21,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337901680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:21,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:21,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:33:21,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983459193] [2025-03-08 11:33:21,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:21,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:33:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:33:21,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:33:21,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:33:21,619 INFO L87 Difference]: Start difference. First operand 2759 states and 3916 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:21,797 INFO L93 Difference]: Finished difference Result 4803 states and 6870 transitions. [2025-03-08 11:33:21,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:33:21,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 234 [2025-03-08 11:33:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:21,816 INFO L225 Difference]: With dead ends: 4803 [2025-03-08 11:33:21,816 INFO L226 Difference]: Without dead ends: 3707 [2025-03-08 11:33:21,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:33:21,821 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 98 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:21,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 505 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:33:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2025-03-08 11:33:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 2765. [2025-03-08 11:33:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2765 states, 2097 states have (on average 1.30758226037196) internal successors, (2742), 2115 states have internal predecessors, (2742), 590 states have call successors, (590), 77 states have call predecessors, (590), 77 states have return successors, (590), 572 states have call predecessors, (590), 590 states have call successors, (590) [2025-03-08 11:33:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3922 transitions. [2025-03-08 11:33:22,000 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3922 transitions. Word has length 234 [2025-03-08 11:33:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:22,000 INFO L471 AbstractCegarLoop]: Abstraction has 2765 states and 3922 transitions. [2025-03-08 11:33:22,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3922 transitions. [2025-03-08 11:33:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 11:33:22,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:22,002 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:22,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:33:22,003 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:22,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash -419599636, now seen corresponding path program 1 times [2025-03-08 11:33:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:33:22,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152510527] [2025-03-08 11:33:22,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:33:22,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 11:33:22,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 11:33:22,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:22,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:33:22,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [555494912] [2025-03-08 11:33:22,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:22,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:33:22,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:33:22,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:33:22,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 11:33:22,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 11:33:22,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 11:33:22,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:22,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:33:22,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:33:22,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 11:33:22,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 11:33:22,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:22,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:33:22,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:33:22,386 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:33:22,387 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:33:22,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 11:33:22,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 11:33:22,596 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:22,721 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:33:22,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:33:22 BoogieIcfgContainer [2025-03-08 11:33:22,725 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:33:22,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:33:22,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:33:22,726 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:33:22,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:33:10" (3/4) ... [2025-03-08 11:33:22,728 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:33:22,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:33:22,729 INFO L158 Benchmark]: Toolchain (without parser) took 12744.53ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 122.7MB in the beginning and 247.5MB in the end (delta: -124.8MB). Peak memory consumption was 253.1MB. Max. memory is 16.1GB. [2025-03-08 11:33:22,729 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:33:22,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.78ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 105.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:33:22,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.38ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 97.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 11:33:22,730 INFO L158 Benchmark]: Boogie Preprocessor took 73.23ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 84.6MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:33:22,730 INFO L158 Benchmark]: IcfgBuilder took 572.85ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 38.2MB in the end (delta: 46.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 11:33:22,730 INFO L158 Benchmark]: TraceAbstraction took 11804.72ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 37.5MB in the beginning and 247.6MB in the end (delta: -210.0MB). Peak memory consumption was 169.2MB. Max. memory is 16.1GB. [2025-03-08 11:33:22,730 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 545.3MB. Free memory was 247.6MB in the beginning and 247.5MB in the end (delta: 72.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:33:22,732 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.80ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.78ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 105.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.38ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 97.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.23ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 84.6MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 572.85ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 38.2MB in the end (delta: 46.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11804.72ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 37.5MB in the beginning and 247.6MB in the end (delta: -210.0MB). Peak memory consumption was 169.2MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 545.3MB. Free memory was 247.6MB in the beginning and 247.5MB in the end (delta: 72.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 112, overapproximation of bitwiseOr at line 101, overapproximation of bitwiseOr at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 146. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned char var_1_23 = 32; [L43] unsigned short int var_1_24 = 8; [L44] signed long int var_1_25 = -64; [L45] unsigned short int var_1_26 = 26914; [L46] unsigned short int var_1_27 = 26182; [L47] unsigned char var_1_28 = 5; [L48] unsigned char var_1_29 = 50; [L49] unsigned char var_1_30 = 10; [L50] signed long int var_1_31 = -32; [L51] unsigned char var_1_32 = 0; [L52] unsigned char var_1_33 = 1; [L53] unsigned char var_1_34 = 0; [L54] signed long int var_1_35 = 1000000; [L55] signed long int var_1_36 = 64; [L56] unsigned char last_1_var_1_3 = 64; [L57] unsigned short int last_1_var_1_6 = 10; [L58] unsigned short int last_1_var_1_15 = 5; [L59] unsigned short int last_1_var_1_20 = 50; [L60] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L184] last_1_var_1_3 = var_1_3 [L185] last_1_var_1_6 = var_1_6 [L186] last_1_var_1_15 = var_1_15 [L187] last_1_var_1_20 = var_1_20 [L188] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L198] RET updateLastVariables() [L199] CALL updateVariables() [L129] var_1_4 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] var_1_5 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L134] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L134] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L135] var_1_9 = __VERIFIER_nondet_long() [L136] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L136] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L137] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L137] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L138] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L138] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L139] var_1_10 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L140] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L141] var_1_11 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L142] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L143] var_1_12 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L144] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L145] var_1_13 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L146] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L147] var_1_14 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L148] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L149] var_1_17 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L150] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L151] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L151] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L152] var_1_18 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L153] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L154] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L154] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L155] var_1_19 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L156] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L157] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L157] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L158] var_1_23 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L159] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L160] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L160] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L161] var_1_25 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_25 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L162] RET assume_abort_if_not(var_1_25 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L163] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L163] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L164] var_1_26 = __VERIFIER_nondet_ushort() [L165] CALL assume_abort_if_not(var_1_26 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L165] RET assume_abort_if_not(var_1_26 >= 16383) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L166] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L166] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L167] var_1_27 = __VERIFIER_nondet_ushort() [L168] CALL assume_abort_if_not(var_1_27 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L168] RET assume_abort_if_not(var_1_27 >= 16384) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L169] CALL assume_abort_if_not(var_1_27 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L169] RET assume_abort_if_not(var_1_27 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L171] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L172] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L172] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L173] var_1_30 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L174] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L175] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L175] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L176] var_1_33 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_33 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L177] RET assume_abort_if_not(var_1_33 >= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L178] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L178] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L179] var_1_34 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L180] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L181] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L181] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L199] RET updateVariables() [L200] CALL step() [L64] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L65] COND TRUE ((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23))) >= var_1_25 [L66] var_1_24 = ((var_1_26 + var_1_27) - var_1_23) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L68] COND TRUE var_1_27 > 0 [L69] var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) : (0))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L71] COND TRUE var_1_26 != 10 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L72] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L76] COND TRUE var_1_26 > 100 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L77] EXPR ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L77] COND TRUE (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_25 [L78] var_1_32 = (! var_1_33) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L83] var_1_35 = ((((var_1_26) > (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) ? (var_1_26) : (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L84] COND FALSE !(var_1_29 > var_1_30) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L91] COND FALSE !(var_1_25 >= var_1_22) [L94] var_1_36 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L97] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L98] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L102] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=65, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L110] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_8=15/8, var_1_9=66] [L111] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L112] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L118] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L119] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L120] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L121] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L121] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L124] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L125] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=1, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=1, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L191] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=1, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L191] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=1, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L191] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=1, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L191-L192] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=1, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=140, var_1_16=1, var_1_17=0, var_1_18=-1, var_1_19=2, var_1_1=1, var_1_20=75, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=75, var_1_5=65, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 223 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 15, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2030 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1980 mSDsluCounter, 7763 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5251 mSDsCounter, 604 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1649 IncrementalHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 604 mSolverCounterUnsat, 2512 mSDtfsCounter, 1649 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1509 GetRequests, 1434 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2765occurred in iteration=14, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1409 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 4555 NumberOfCodeBlocks, 4555 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4295 ConstructedInterpolants, 0 QuantifiedInterpolants, 10233 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2093 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 42300/42636 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 11:33:22,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.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 2488085725fecf3e41843357112538a95cf6d7d4f37e4c2a3a245a1de1fa0759 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:33:24,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:33:24,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:33:24,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:33:24,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:33:24,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:33:24,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:33:24,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:33:24,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:33:24,751 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:33:24,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:33:24,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:33:24,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:33:24,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:33:24,753 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:33:24,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:33:24,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:33:24,753 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:33:24,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:33:24,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:33:24,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:33:24,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:33:24,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:33:24,754 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:33:24,754 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:33:24,754 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:33:24,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:33:24,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:33:24,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:33:24,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:33:24,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:33:24,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:33:24,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:33:24,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:33:24,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:33:24,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:33:24,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:33:24,755 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:33:24,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:33:24,755 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:33:24,755 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:33:24,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:33:24,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:33:24,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:33:24,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:33:24,756 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 -> 2488085725fecf3e41843357112538a95cf6d7d4f37e4c2a3a245a1de1fa0759 [2025-03-08 11:33:24,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:33:24,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:33:24,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:33:24,983 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:33:24,983 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:33:24,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i [2025-03-08 11:33:26,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce86c709/dcddfd3d6bf2400fa794f972189c4815/FLAG9ea6df52e [2025-03-08 11:33:26,365 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:33:26,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i [2025-03-08 11:33:26,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce86c709/dcddfd3d6bf2400fa794f972189c4815/FLAG9ea6df52e [2025-03-08 11:33:26,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce86c709/dcddfd3d6bf2400fa794f972189c4815 [2025-03-08 11:33:26,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:33:26,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:33:26,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:33:26,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:33:26,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:33:26,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8f2e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26, skipping insertion in model container [2025-03-08 11:33:26,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:33:26,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i[915,928] [2025-03-08 11:33:26,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:33:26,614 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:33:26,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-78.i[915,928] [2025-03-08 11:33:26,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:33:26,681 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:33:26,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26 WrapperNode [2025-03-08 11:33:26,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:33:26,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:33:26,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:33:26,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:33:26,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,721 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2025-03-08 11:33:26,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:33:26,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:33:26,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:33:26,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:33:26,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,738 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:33:26,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:33:26,793 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:33:26,793 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:33:26,793 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:33:26,794 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (1/1) ... [2025-03-08 11:33:26,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:33:26,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:33:26,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:33:26,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:33:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:33:26,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:33:26,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:33:26,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:33:26,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:33:26,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:33:26,911 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:33:26,913 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:33:35,852 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 11:33:35,853 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:33:35,867 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:33:35,867 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:33:35,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:33:35 BoogieIcfgContainer [2025-03-08 11:33:35,868 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:33:35,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:33:35,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:33:35,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:33:35,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:33:26" (1/3) ... [2025-03-08 11:33:35,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157839fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:33:35, skipping insertion in model container [2025-03-08 11:33:35,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:33:26" (2/3) ... [2025-03-08 11:33:35,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157839fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:33:35, skipping insertion in model container [2025-03-08 11:33:35,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:33:35" (3/3) ... [2025-03-08 11:33:35,875 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-78.i [2025-03-08 11:33:35,885 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:33:35,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-78.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:33:35,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:33:35,941 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;@3284467b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:33:35,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:33:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:33:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 11:33:35,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:35,953 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:35,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:35,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash -856545804, now seen corresponding path program 1 times [2025-03-08 11:33:35,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:33:35,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446582844] [2025-03-08 11:33:35,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:35,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:33:35,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:33:35,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:33:35,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 11:33:36,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 11:33:36,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 11:33:36,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:36,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:36,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:33:36,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:33:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 794 proven. 0 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2025-03-08 11:33:36,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:33:36,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:33:36,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446582844] [2025-03-08 11:33:36,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446582844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:36,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:36,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:33:36,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849432019] [2025-03-08 11:33:36,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:36,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:33:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:33:36,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:33:36,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:33:36,474 INFO L87 Difference]: Start difference. First operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 11:33:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:36,499 INFO L93 Difference]: Finished difference Result 178 states and 315 transitions. [2025-03-08 11:33:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:33:36,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 214 [2025-03-08 11:33:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:36,505 INFO L225 Difference]: With dead ends: 178 [2025-03-08 11:33:36,505 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 11:33:36,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:33:36,509 INFO L435 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:36,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:33:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 11:33:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 11:33:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:33:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2025-03-08 11:33:36,540 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 138 transitions. Word has length 214 [2025-03-08 11:33:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:36,541 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 138 transitions. [2025-03-08 11:33:36,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 11:33:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 138 transitions. [2025-03-08 11:33:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 11:33:36,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:36,544 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:36,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 11:33:36,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:33:36,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:36,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:36,745 INFO L85 PathProgramCache]: Analyzing trace with hash 731541882, now seen corresponding path program 1 times [2025-03-08 11:33:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:33:36,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652316982] [2025-03-08 11:33:36,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:36,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:33:36,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:33:36,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:33:36,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 11:33:36,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 11:33:37,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 11:33:37,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:37,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:37,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 11:33:37,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:33:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1058 proven. 60 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2025-03-08 11:33:38,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:33:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 33 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-08 11:33:39,012 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:33:39,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652316982] [2025-03-08 11:33:39,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652316982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:33:39,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:33:39,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2025-03-08 11:33:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612899707] [2025-03-08 11:33:39,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:33:39,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:33:39,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:33:39,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:33:39,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:33:39,018 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-08 11:33:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:33:40,226 INFO L93 Difference]: Finished difference Result 185 states and 281 transitions. [2025-03-08 11:33:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 11:33:40,228 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 214 [2025-03-08 11:33:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:33:40,230 INFO L225 Difference]: With dead ends: 185 [2025-03-08 11:33:40,230 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 11:33:40,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:33:40,231 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 185 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:33:40,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 264 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 11:33:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 11:33:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-03-08 11:33:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 59 states have internal predecessors, (73), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 11:33:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2025-03-08 11:33:40,242 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 214 [2025-03-08 11:33:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:33:40,242 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2025-03-08 11:33:40,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-08 11:33:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2025-03-08 11:33:40,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-08 11:33:40,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:33:40,248 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:33:40,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:33:40,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:33:40,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:33:40,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:33:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash -398648773, now seen corresponding path program 1 times [2025-03-08 11:33:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:33:40,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147557245] [2025-03-08 11:33:40,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:33:40,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:33:40,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:33:40,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:33:40,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 11:33:40,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 11:33:40,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 11:33:40,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:33:40,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:33:40,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:33:40,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:33:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:33:43,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:33:43,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:33:43,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147557245] [2025-03-08 11:33:43,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147557245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:33:43,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:33:43,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:33:43,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655406570] [2025-03-08 11:33:43,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:33:43,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:33:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:33:43,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:33:43,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:33:43,385 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:33:48,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:33:52,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:33:54,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:33:58,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:34:01,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:34:05,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:34:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:34:05,323 INFO L93 Difference]: Finished difference Result 298 states and 434 transitions. [2025-03-08 11:34:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:34:05,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2025-03-08 11:34:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:34:05,360 INFO L225 Difference]: With dead ends: 298 [2025-03-08 11:34:05,360 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 11:34:05,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:34:05,365 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 69 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:34:05,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 463 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 100 Invalid, 4 Unknown, 0 Unchecked, 21.8s Time] [2025-03-08 11:34:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 11:34:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 189. [2025-03-08 11:34:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 114 states have (on average 1.236842105263158) internal successors, (141), 114 states have internal predecessors, (141), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:34:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2025-03-08 11:34:05,405 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 216 [2025-03-08 11:34:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:34:05,406 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2025-03-08 11:34:05,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:34:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2025-03-08 11:34:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-08 11:34:05,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:05,411 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:05,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 11:34:05,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:34:05,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:05,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -269566054, now seen corresponding path program 1 times [2025-03-08 11:34:05,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:34:05,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027735790] [2025-03-08 11:34:05,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:05,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:34:05,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:34:05,616 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:34:05,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 11:34:05,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 11:34:05,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 11:34:05,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:05,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:05,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 11:34:05,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:34:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:34:06,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:34:06,042 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:34:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027735790] [2025-03-08 11:34:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027735790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:06,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:34:06,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:34:06,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91351375] [2025-03-08 11:34:06,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:06,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:34:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:34:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:34:06,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:34:06,043 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:34:10,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 11:34:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:34:10,164 INFO L93 Difference]: Finished difference Result 283 states and 415 transitions. [2025-03-08 11:34:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:34:10,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2025-03-08 11:34:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:34:10,201 INFO L225 Difference]: With dead ends: 283 [2025-03-08 11:34:10,201 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 11:34:10,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:34:10,202 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:34:10,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 11:34:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 11:34:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-08 11:34:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 114 states have (on average 1.219298245614035) internal successors, (139), 114 states have internal predecessors, (139), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:34:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2025-03-08 11:34:10,235 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 216 [2025-03-08 11:34:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:34:10,235 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2025-03-08 11:34:10,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:34:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2025-03-08 11:34:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-08 11:34:10,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:34:10,237 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:34:10,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 11:34:10,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:34:10,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:34:10,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:34:10,438 INFO L85 PathProgramCache]: Analyzing trace with hash -614316368, now seen corresponding path program 1 times [2025-03-08 11:34:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:34:10,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435562263] [2025-03-08 11:34:10,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:34:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 11:34:10,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:34:10,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 11:34:10,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 11:34:10,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 11:34:10,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 11:34:10,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:34:10,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:34:10,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:34:10,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:34:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-08 11:34:14,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:34:14,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:34:14,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435562263] [2025-03-08 11:34:14,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435562263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:34:14,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:34:14,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:34:14,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530465084] [2025-03-08 11:34:14,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:34:14,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:34:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:34:14,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:34:14,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:34:14,335 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-08 11:34:19,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:34:23,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:34:27,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:34:30,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:34:35,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:34:38,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:34:42,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []