./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_loopvsstraightlinecode_100-while_file-22.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 ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:07:47,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:07:48,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:07:48,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:07:48,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:07:48,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:07:48,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:07:48,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:07:48,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:07:48,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:07:48,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:07:48,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:07:48,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:07:48,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:07:48,071 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:07:48,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:07:48,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:07:48,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:07:48,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:07:48,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:07:48,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:07:48,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:07:48,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:07:48,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:07:48,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:07:48,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:07:48,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:07:48,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:07:48,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:07:48,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:07:48,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:07:48,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:07:48,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:07:48,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:07:48,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:07:48,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:07:48,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:07:48,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:07:48,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:07:48,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:07:48,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:07:48,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:07:48,086 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac [2024-11-12 05:07:48,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:07:48,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:07:48,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:07:48,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:07:48,391 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:07:48,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-12 05:07:49,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:07:50,122 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:07:50,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-12 05:07:50,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96a1f5057/b6959d297cba45cbb44597e9035fdedb/FLAG50ac37aca [2024-11-12 05:07:50,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96a1f5057/b6959d297cba45cbb44597e9035fdedb [2024-11-12 05:07:50,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:07:50,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:07:50,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:07:50,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:07:50,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:07:50,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:50,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7f13d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50, skipping insertion in model container [2024-11-12 05:07:50,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:50,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:07:50,695 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_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-11-12 05:07:50,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:07:50,795 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:07:50,805 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_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-11-12 05:07:50,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:07:50,876 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:07:50,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50 WrapperNode [2024-11-12 05:07:50,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:07:50,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:07:50,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:07:50,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:07:50,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:50,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:50,958 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-11-12 05:07:50,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:07:50,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:07:50,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:07:50,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:07:50,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:50,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:50,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:51,011 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]. [2024-11-12 05:07:51,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:51,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:51,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:51,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:51,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:51,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:51,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:07:51,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:07:51,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:07:51,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:07:51,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (1/1) ... [2024-11-12 05:07:51,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:07:51,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:07:51,080 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) [2024-11-12 05:07:51,086 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 [2024-11-12 05:07:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:07:51,137 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:07:51,138 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:07:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:07:51,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:07:51,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:07:51,258 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:07:51,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:07:51,794 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-12 05:07:51,794 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:07:51,817 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:07:51,817 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:07:51,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:07:51 BoogieIcfgContainer [2024-11-12 05:07:51,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:07:51,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:07:51,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:07:51,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:07:51,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:07:50" (1/3) ... [2024-11-12 05:07:51,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316ed90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:07:51, skipping insertion in model container [2024-11-12 05:07:51,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:07:50" (2/3) ... [2024-11-12 05:07:51,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316ed90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:07:51, skipping insertion in model container [2024-11-12 05:07:51,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:07:51" (3/3) ... [2024-11-12 05:07:51,828 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-12 05:07:51,850 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:07:51,850 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:07:51,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:07:51,926 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;@3525ec00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:07:51,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:07:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 05:07:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-12 05:07:51,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:07:51,954 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:07:51,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:07:51,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:07:51,963 INFO L85 PathProgramCache]: Analyzing trace with hash 571954899, now seen corresponding path program 1 times [2024-11-12 05:07:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:07:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070729820] [2024-11-12 05:07:51,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:07:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:07:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:07:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:07:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:07:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:07:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:07:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:07:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:07:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:07:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:07:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:07:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:07:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:07:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:07:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:07:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:07:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:07:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:07:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:07:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:07:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:07:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:07:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:07:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:07:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:07:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:07:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:53,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:07:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:53,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:07:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:53,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:07:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:53,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 05:07:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:53,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:07:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:07:53,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:07:53,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070729820] [2024-11-12 05:07:53,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070729820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:07:53,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:07:53,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 05:07:53,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458369723] [2024-11-12 05:07:53,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:07:53,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 05:07:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:07:53,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 05:07:53,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:07:53,100 INFO L87 Difference]: Start difference. First operand has 101 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:07:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:07:53,582 INFO L93 Difference]: Finished difference Result 325 states and 582 transitions. [2024-11-12 05:07:53,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:07:53,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-11-12 05:07:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:07:53,598 INFO L225 Difference]: With dead ends: 325 [2024-11-12 05:07:53,600 INFO L226 Difference]: Without dead ends: 227 [2024-11-12 05:07:53,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:07:53,612 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 200 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:07:53,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 666 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:07:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-12 05:07:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2024-11-12 05:07:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 147 states have (on average 1.4217687074829932) internal successors, (209), 147 states have internal predecessors, (209), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 05:07:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 333 transitions. [2024-11-12 05:07:53,695 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 333 transitions. Word has length 199 [2024-11-12 05:07:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:07:53,696 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 333 transitions. [2024-11-12 05:07:53,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:07:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 333 transitions. [2024-11-12 05:07:53,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-12 05:07:53,701 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:07:53,701 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:07:53,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:07:53,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:07:53,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:07:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1650107533, now seen corresponding path program 1 times [2024-11-12 05:07:53,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:07:53,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472012635] [2024-11-12 05:07:53,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:07:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:07:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:07:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:07:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:07:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:07:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:07:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:07:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:07:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:07:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:07:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:07:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:07:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:07:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:07:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:07:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:07:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:07:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:07:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:07:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:07:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:07:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:07:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:07:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:07:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:07:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:07:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:07:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:07:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:07:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 05:07:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:07:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:07:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:07:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472012635] [2024-11-12 05:07:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472012635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:07:54,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:07:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:07:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570758087] [2024-11-12 05:07:54,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:07:54,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:07:54,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:07:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:07:54,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:07:54,425 INFO L87 Difference]: Start difference. First operand 212 states and 333 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:07:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:07:54,721 INFO L93 Difference]: Finished difference Result 550 states and 861 transitions. [2024-11-12 05:07:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:07:54,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-11-12 05:07:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:07:54,730 INFO L225 Difference]: With dead ends: 550 [2024-11-12 05:07:54,731 INFO L226 Difference]: Without dead ends: 341 [2024-11-12 05:07:54,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:07:54,737 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 120 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:07:54,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 404 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:07:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-12 05:07:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 315. [2024-11-12 05:07:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 218 states have (on average 1.426605504587156) internal successors, (311), 218 states have internal predecessors, (311), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-12 05:07:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 497 transitions. [2024-11-12 05:07:54,817 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 497 transitions. Word has length 200 [2024-11-12 05:07:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:07:54,820 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 497 transitions. [2024-11-12 05:07:54,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:07:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 497 transitions. [2024-11-12 05:07:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-12 05:07:54,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:07:54,824 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:07:54,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:07:54,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:07:54,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:07:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash 84159315, now seen corresponding path program 1 times [2024-11-12 05:07:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:07:54,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474315985] [2024-11-12 05:07:54,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:54,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:07:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:07:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:07:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:07:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:07:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:07:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:07:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:07:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:07:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:07:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:07:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:07:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:07:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:07:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:07:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:07:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:07:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:07:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:07:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:07:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:07:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:07:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:07:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:07:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:07:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:07:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:07:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:07:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:07:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:07:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 05:07:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:07:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:07:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:07:55,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474315985] [2024-11-12 05:07:55,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474315985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:07:55,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:07:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:07:55,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177970674] [2024-11-12 05:07:55,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:07:55,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:07:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:07:55,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:07:55,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:07:55,453 INFO L87 Difference]: Start difference. First operand 315 states and 497 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:07:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:07:55,706 INFO L93 Difference]: Finished difference Result 795 states and 1259 transitions. [2024-11-12 05:07:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:07:55,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2024-11-12 05:07:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:07:55,713 INFO L225 Difference]: With dead ends: 795 [2024-11-12 05:07:55,713 INFO L226 Difference]: Without dead ends: 570 [2024-11-12 05:07:55,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:07:55,716 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 82 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:07:55,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 333 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:07:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-12 05:07:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 563. [2024-11-12 05:07:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 402 states have (on average 1.435323383084577) internal successors, (577), 402 states have internal predecessors, (577), 155 states have call successors, (155), 5 states have call predecessors, (155), 5 states have return successors, (155), 155 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-12 05:07:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 887 transitions. [2024-11-12 05:07:55,790 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 887 transitions. Word has length 204 [2024-11-12 05:07:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:07:55,791 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 887 transitions. [2024-11-12 05:07:55,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:07:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 887 transitions. [2024-11-12 05:07:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-12 05:07:55,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:07:55,795 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:07:55,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:07:55,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:07:55,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:07:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -926957935, now seen corresponding path program 1 times [2024-11-12 05:07:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:07:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330445051] [2024-11-12 05:07:55,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:07:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:07:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:07:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:07:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:07:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:07:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:07:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:07:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:07:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:07:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:07:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:07:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:07:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:07:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:07:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:07:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:07:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:07:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:07:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:07:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:07:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:07:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:07:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:07:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:07:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:07:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:07:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:07:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:07:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:07:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 05:07:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:07:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:07:56,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:07:56,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330445051] [2024-11-12 05:07:56,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330445051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:07:56,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:07:56,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:07:56,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13030402] [2024-11-12 05:07:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:07:56,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:07:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:07:56,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:07:56,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:07:56,408 INFO L87 Difference]: Start difference. First operand 563 states and 887 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:07:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:07:56,703 INFO L93 Difference]: Finished difference Result 1424 states and 2241 transitions. [2024-11-12 05:07:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:07:56,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2024-11-12 05:07:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:07:56,710 INFO L225 Difference]: With dead ends: 1424 [2024-11-12 05:07:56,710 INFO L226 Difference]: Without dead ends: 971 [2024-11-12 05:07:56,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:07:56,713 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 222 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:07:56,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 512 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:07:56,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-12 05:07:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 807. [2024-11-12 05:07:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 582 states have (on average 1.4398625429553265) internal successors, (838), 582 states have internal predecessors, (838), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2024-11-12 05:07:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1272 transitions. [2024-11-12 05:07:56,830 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1272 transitions. Word has length 204 [2024-11-12 05:07:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:07:56,831 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1272 transitions. [2024-11-12 05:07:56,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:07:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1272 transitions. [2024-11-12 05:07:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-12 05:07:56,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:07:56,835 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:07:56,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:07:56,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:07:56,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:07:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1984379059, now seen corresponding path program 1 times [2024-11-12 05:07:56,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:07:56,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483401288] [2024-11-12 05:07:56,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:07:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:07:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:07:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:07:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:07:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:07:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:07:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:07:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:07:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:07:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:07:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:07:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:07:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:07:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:07:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:07:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:07:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:07:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:07:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:07:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:07:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:07:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:07:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:07:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:07:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:07:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:07:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:07:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:07:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:07:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 05:07:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:07:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:07:57,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:07:57,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483401288] [2024-11-12 05:07:57,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483401288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:07:57,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:07:57,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:07:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204628519] [2024-11-12 05:07:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:07:57,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:07:57,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:07:57,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:07:57,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:07:57,186 INFO L87 Difference]: Start difference. First operand 807 states and 1272 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:07:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:07:57,329 INFO L93 Difference]: Finished difference Result 1962 states and 3090 transitions. [2024-11-12 05:07:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:07:57,330 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-12 05:07:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:07:57,337 INFO L225 Difference]: With dead ends: 1962 [2024-11-12 05:07:57,338 INFO L226 Difference]: Without dead ends: 1259 [2024-11-12 05:07:57,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:07:57,341 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 87 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:07:57,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 499 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:07:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2024-11-12 05:07:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 905. [2024-11-12 05:07:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 680 states have (on average 1.4338235294117647) internal successors, (975), 680 states have internal predecessors, (975), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2024-11-12 05:07:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1409 transitions. [2024-11-12 05:07:57,431 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1409 transitions. Word has length 205 [2024-11-12 05:07:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:07:57,432 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1409 transitions. [2024-11-12 05:07:57,432 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:07:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1409 transitions. [2024-11-12 05:07:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-12 05:07:57,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:07:57,435 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:07:57,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:07:57,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:07:57,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:07:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 295435317, now seen corresponding path program 1 times [2024-11-12 05:07:57,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:07:57,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481433065] [2024-11-12 05:07:57,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:07:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:07:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:07:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:07:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:07:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:07:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:07:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:07:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:07:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:07:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:07:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:07:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:07:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:07:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:07:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:07:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:07:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:07:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:07:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:07:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:07:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:07:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:07:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:07:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:07:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:07:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:07:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:07:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:07:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:07:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 05:07:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:07:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-12 05:07:58,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:07:58,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481433065] [2024-11-12 05:07:58,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481433065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:07:58,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934229344] [2024-11-12 05:07:58,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:58,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:07:58,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:07:58,699 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) [2024-11-12 05:07:58,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:07:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:58,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 05:07:58,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:08:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 852 proven. 63 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2024-11-12 05:08:00,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:08:02,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 126 proven. 51 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-11-12 05:08:02,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934229344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:08:02,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:08:02,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 34 [2024-11-12 05:08:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449897917] [2024-11-12 05:08:02,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:08:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-12 05:08:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:08:02,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-12 05:08:02,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 05:08:02,464 INFO L87 Difference]: Start difference. First operand 905 states and 1409 transitions. Second operand has 34 states, 32 states have (on average 4.59375) internal successors, (147), 32 states have internal predecessors, (147), 11 states have call successors, (93), 5 states have call predecessors, (93), 9 states have return successors, (93), 10 states have call predecessors, (93), 11 states have call successors, (93) [2024-11-12 05:08:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:08:05,567 INFO L93 Difference]: Finished difference Result 2732 states and 4187 transitions. [2024-11-12 05:08:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-12 05:08:05,569 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 4.59375) internal successors, (147), 32 states have internal predecessors, (147), 11 states have call successors, (93), 5 states have call predecessors, (93), 9 states have return successors, (93), 10 states have call predecessors, (93), 11 states have call successors, (93) Word has length 205 [2024-11-12 05:08:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:08:05,582 INFO L225 Difference]: With dead ends: 2732 [2024-11-12 05:08:05,582 INFO L226 Difference]: Without dead ends: 1997 [2024-11-12 05:08:05,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=841, Invalid=2699, Unknown=0, NotChecked=0, Total=3540 [2024-11-12 05:08:05,587 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 797 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:08:05,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1423 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 05:08:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2024-11-12 05:08:05,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1284. [2024-11-12 05:08:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 923 states have (on average 1.4019501625135429) internal successors, (1294), 929 states have internal predecessors, (1294), 343 states have call successors, (343), 17 states have call predecessors, (343), 17 states have return successors, (343), 337 states have call predecessors, (343), 343 states have call successors, (343) [2024-11-12 05:08:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1980 transitions. [2024-11-12 05:08:05,754 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1980 transitions. Word has length 205 [2024-11-12 05:08:05,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:08:05,755 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1980 transitions. [2024-11-12 05:08:05,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 4.59375) internal successors, (147), 32 states have internal predecessors, (147), 11 states have call successors, (93), 5 states have call predecessors, (93), 9 states have return successors, (93), 10 states have call predecessors, (93), 11 states have call successors, (93) [2024-11-12 05:08:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1980 transitions. [2024-11-12 05:08:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-12 05:08:05,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:05,758 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:05,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:08:05,962 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,SelfDestructingSolverStorable5 [2024-11-12 05:08:05,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:05,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1851169506, now seen corresponding path program 1 times [2024-11-12 05:08:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:08:05,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788401190] [2024-11-12 05:08:05,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:05,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:08:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:08:06,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975631105] [2024-11-12 05:08:06,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:06,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:08:06,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:08:06,332 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) [2024-11-12 05:08:06,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 05:08:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:06,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-12 05:08:06,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:08:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1498 proven. 186 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-12 05:08:12,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:08:28,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:08:28,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788401190] [2024-11-12 05:08:28,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 05:08:28,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975631105] [2024-11-12 05:08:28,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975631105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:08:28,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:08:28,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2024-11-12 05:08:28,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799863635] [2024-11-12 05:08:28,489 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 05:08:28,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 05:08:28,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:08:28,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 05:08:28,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=3001, Unknown=1, NotChecked=0, Total=3660 [2024-11-12 05:08:28,492 INFO L87 Difference]: Start difference. First operand 1284 states and 1980 transitions. Second operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 44 states have internal predecessors, (104), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) [2024-11-12 05:08:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:08:33,074 INFO L93 Difference]: Finished difference Result 2409 states and 3580 transitions. [2024-11-12 05:08:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-12 05:08:33,076 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 44 states have internal predecessors, (104), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) Word has length 205 [2024-11-12 05:08:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:08:33,090 INFO L225 Difference]: With dead ends: 2409 [2024-11-12 05:08:33,090 INFO L226 Difference]: Without dead ends: 2038 [2024-11-12 05:08:33,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3404 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2252, Invalid=10403, Unknown=1, NotChecked=0, Total=12656 [2024-11-12 05:08:33,098 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 696 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 05:08:33,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1738 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 05:08:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2024-11-12 05:08:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1784. [2024-11-12 05:08:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1295 states have (on average 1.3606177606177605) internal successors, (1762), 1311 states have internal predecessors, (1762), 449 states have call successors, (449), 39 states have call predecessors, (449), 39 states have return successors, (449), 433 states have call predecessors, (449), 449 states have call successors, (449) [2024-11-12 05:08:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2660 transitions. [2024-11-12 05:08:33,343 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2660 transitions. Word has length 205 [2024-11-12 05:08:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:08:33,344 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2660 transitions. [2024-11-12 05:08:33,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 44 states have internal predecessors, (104), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) [2024-11-12 05:08:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2660 transitions. [2024-11-12 05:08:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-12 05:08:33,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:33,349 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:33,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 05:08:33,549 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,SelfDestructingSolverStorable6 [2024-11-12 05:08:33,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:33,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1422729436, now seen corresponding path program 1 times [2024-11-12 05:08:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:08:33,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269195181] [2024-11-12 05:08:33,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:08:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:08:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:08:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:08:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:08:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:08:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:08:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:08:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:08:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:08:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:08:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:08:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:08:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:08:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:08:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:08:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:08:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:08:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:08:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:08:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:08:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:08:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:08:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:08:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:08:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:08:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:08:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:08:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:08:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:08:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 05:08:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:08:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:08:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:08:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269195181] [2024-11-12 05:08:33,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269195181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:08:33,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:08:33,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:08:33,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978459779] [2024-11-12 05:08:33,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:08:33,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:08:33,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:08:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:08:33,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:08:33,710 INFO L87 Difference]: Start difference. First operand 1784 states and 2660 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:08:34,001 INFO L93 Difference]: Finished difference Result 3592 states and 5405 transitions. [2024-11-12 05:08:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:08:34,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-12 05:08:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:08:34,015 INFO L225 Difference]: With dead ends: 3592 [2024-11-12 05:08:34,015 INFO L226 Difference]: Without dead ends: 2165 [2024-11-12 05:08:34,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:08:34,021 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 40 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:08:34,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 291 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:08:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2024-11-12 05:08:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1957. [2024-11-12 05:08:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1468 states have (on average 1.3732970027247957) internal successors, (2016), 1484 states have internal predecessors, (2016), 449 states have call successors, (449), 39 states have call predecessors, (449), 39 states have return successors, (449), 433 states have call predecessors, (449), 449 states have call successors, (449) [2024-11-12 05:08:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 2914 transitions. [2024-11-12 05:08:34,280 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 2914 transitions. Word has length 205 [2024-11-12 05:08:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:08:34,280 INFO L471 AbstractCegarLoop]: Abstraction has 1957 states and 2914 transitions. [2024-11-12 05:08:34,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2914 transitions. [2024-11-12 05:08:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-12 05:08:34,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:34,286 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:34,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 05:08:34,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:34,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1789129892, now seen corresponding path program 1 times [2024-11-12 05:08:34,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:08:34,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664275744] [2024-11-12 05:08:34,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:34,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:08:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:08:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:08:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:08:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:08:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:08:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:08:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:08:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:08:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:08:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:08:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:08:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:08:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:08:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:08:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:08:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:08:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:08:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:08:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:08:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:08:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:08:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:08:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:08:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:08:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:08:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 05:08:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:08:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 05:08:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:08:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 05:08:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:08:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:08:34,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:08:34,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664275744] [2024-11-12 05:08:34,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664275744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:08:34,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:08:34,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 05:08:34,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868597371] [2024-11-12 05:08:34,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:08:34,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 05:08:34,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:08:34,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 05:08:34,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:08:34,656 INFO L87 Difference]: Start difference. First operand 1957 states and 2914 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:08:35,165 INFO L93 Difference]: Finished difference Result 3616 states and 5405 transitions. [2024-11-12 05:08:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:08:35,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-12 05:08:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:08:35,181 INFO L225 Difference]: With dead ends: 3616 [2024-11-12 05:08:35,182 INFO L226 Difference]: Without dead ends: 2674 [2024-11-12 05:08:35,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:08:35,188 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 177 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:08:35,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 643 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:08:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-11-12 05:08:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2444. [2024-11-12 05:08:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 1788 states have (on average 1.3450782997762865) internal successors, (2405), 1811 states have internal predecessors, (2405), 606 states have call successors, (606), 49 states have call predecessors, (606), 49 states have return successors, (606), 583 states have call predecessors, (606), 606 states have call successors, (606) [2024-11-12 05:08:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3617 transitions. [2024-11-12 05:08:35,532 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3617 transitions. Word has length 205 [2024-11-12 05:08:35,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:08:35,533 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 3617 transitions. [2024-11-12 05:08:35,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:35,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3617 transitions. [2024-11-12 05:08:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-12 05:08:35,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:35,536 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:35,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 05:08:35,537 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash -537705163, now seen corresponding path program 1 times [2024-11-12 05:08:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:08:35,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301579595] [2024-11-12 05:08:35,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:35,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:08:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:08:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703539635] [2024-11-12 05:08:35,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:35,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:08:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:08:35,869 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) [2024-11-12 05:08:35,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 05:08:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:08:36,026 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:08:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:08:36,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:08:36,262 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:08:36,263 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:08:36,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 05:08:36,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:08:36,470 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:36,641 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:08:36,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:08:36 BoogieIcfgContainer [2024-11-12 05:08:36,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:08:36,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:08:36,645 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:08:36,646 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:08:36,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:07:51" (3/4) ... [2024-11-12 05:08:36,650 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:08:36,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:08:36,652 INFO L158 Benchmark]: Toolchain (without parser) took 46187.95ms. Allocated memory was 167.8MB in the beginning and 740.3MB in the end (delta: 572.5MB). Free memory was 111.7MB in the beginning and 486.6MB in the end (delta: -374.9MB). Peak memory consumption was 200.3MB. Max. memory is 16.1GB. [2024-11-12 05:08:36,652 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:08:36,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.32ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 91.4MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 05:08:36,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.07ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 85.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 05:08:36,653 INFO L158 Benchmark]: Boogie Preprocessor took 83.71ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 74.5MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 05:08:36,653 INFO L158 Benchmark]: RCFGBuilder took 775.31ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 74.5MB in the beginning and 185.8MB in the end (delta: -111.4MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2024-11-12 05:08:36,654 INFO L158 Benchmark]: TraceAbstraction took 44821.82ms. Allocated memory was 245.4MB in the beginning and 740.3MB in the end (delta: 494.9MB). Free memory was 185.8MB in the beginning and 486.6MB in the end (delta: -300.7MB). Peak memory consumption was 194.2MB. Max. memory is 16.1GB. [2024-11-12 05:08:36,654 INFO L158 Benchmark]: Witness Printer took 6.19ms. Allocated memory is still 740.3MB. Free memory is still 486.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:08:36,655 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.21ms. Allocated memory is still 167.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.32ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 91.4MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.07ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 85.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.71ms. Allocated memory is still 167.8MB. Free memory was 85.0MB in the beginning and 74.5MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 775.31ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 74.5MB in the beginning and 185.8MB in the end (delta: -111.4MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 44821.82ms. Allocated memory was 245.4MB in the beginning and 740.3MB in the end (delta: 494.9MB). Free memory was 185.8MB in the beginning and 486.6MB in the end (delta: -300.7MB). Peak memory consumption was 194.2MB. Max. memory is 16.1GB. * Witness Printer took 6.19ms. Allocated memory is still 740.3MB. Free memory is still 486.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 204, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of bitwiseOr at line 204. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed short int var_1_6 = -1; [L24] unsigned char var_1_7 = 1; [L25] unsigned char var_1_8 = 1; [L26] signed char var_1_9 = -128; [L27] signed char var_1_12 = 10; [L28] signed char var_1_13 = -64; [L29] signed char var_1_14 = 1; [L30] signed char var_1_15 = -25; [L31] unsigned short int var_1_16 = 256; [L32] signed char var_1_18 = 4; [L33] float var_1_19 = 100.5; [L34] float var_1_20 = 4.5; [L35] signed char var_1_21 = 0; [L36] signed char var_1_22 = 64; [L37] signed char var_1_23 = 2; [L38] signed char var_1_24 = 4; [L39] unsigned long int var_1_25 = 8; [L40] unsigned char var_1_27 = 50; [L41] unsigned char var_1_28 = 5; [L42] signed short int var_1_29 = 32; [L43] signed long int var_1_30 = 1; [L44] signed long int var_1_31 = 0; [L45] unsigned char var_1_33 = 2; [L46] unsigned char var_1_34 = 128; [L47] unsigned char var_1_35 = 2; [L48] unsigned char var_1_36 = 200; [L49] unsigned char var_1_37 = 32; [L50] double var_1_38 = 10.3; [L51] signed short int var_1_39 = -256; [L52] signed short int last_1_var_1_6 = -1; [L53] signed char last_1_var_1_9 = -128; [L54] unsigned short int last_1_var_1_16 = 256; [L55] signed char last_1_var_1_18 = 4; [L56] float last_1_var_1_19 = 100.5; [L57] unsigned long int last_1_var_1_25 = 8; [L58] unsigned char last_1_var_1_27 = 50; [L59] signed short int last_1_var_1_29 = 32; [L60] unsigned char last_1_var_1_33 = 2; [L61] unsigned char last_1_var_1_35 = 2; VAL [isInitial=0, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128] [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] CALL updateLastVariables() [L192] last_1_var_1_6 = var_1_6 [L193] last_1_var_1_9 = var_1_9 [L194] last_1_var_1_16 = var_1_16 [L195] last_1_var_1_18 = var_1_18 [L196] last_1_var_1_19 = var_1_19 [L197] last_1_var_1_25 = var_1_25 [L198] last_1_var_1_27 = var_1_27 [L199] last_1_var_1_29 = var_1_29 [L200] last_1_var_1_33 = var_1_33 [L201] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128] [L211] RET updateLastVariables() [L212] CALL updateVariables() [L143] var_1_7 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L145] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L145] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L148] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L148] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L149] var_1_12 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L150] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L151] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L151] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L152] var_1_13 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L153] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L154] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L154] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L155] var_1_14 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L156] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L157] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L157] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L158] var_1_15 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L159] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L160] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L160] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L161] var_1_20 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L162] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L163] var_1_22 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L164] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L165] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L165] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L166] var_1_23 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L168] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L168] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L169] var_1_24 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L170] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L171] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L171] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L172] var_1_28 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L173] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L174] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L174] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L175] var_1_30 = __VERIFIER_nondet_long() [L176] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L176] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L177] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L177] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L178] var_1_31 = __VERIFIER_nondet_long() [L179] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L179] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L181] var_1_34 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_34 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L182] RET assume_abort_if_not(var_1_34 >= 127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L183] CALL assume_abort_if_not(var_1_34 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L183] RET assume_abort_if_not(var_1_34 <= 254) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L184] var_1_36 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_36 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L185] RET assume_abort_if_not(var_1_36 >= 190) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L186] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L186] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L187] var_1_37 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_37 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L188] RET assume_abort_if_not(var_1_37 >= 31) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L189] CALL assume_abort_if_not(var_1_37 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L189] RET assume_abort_if_not(var_1_37 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L212] RET updateVariables() [L213] CALL step() [L65] signed long int stepLocal_0 = 50 * last_1_var_1_29; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L66] EXPR last_1_var_1_16 | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L66] COND FALSE !((last_1_var_1_16 | last_1_var_1_9) >= stepLocal_0) [L69] COND FALSE !((last_1_var_1_19 + last_1_var_1_19) > 200.875f) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L76] signed long int stepLocal_4 = last_1_var_1_9; [L77] signed long int stepLocal_3 = var_1_24 % var_1_34; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=62, stepLocal_4=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L78] COND FALSE !(last_1_var_1_16 <= stepLocal_4) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=62, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L81] COND TRUE stepLocal_3 >= last_1_var_1_27 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L82] COND FALSE !(\read(var_1_7)) [L85] var_1_33 = var_1_28 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L89] var_1_19 = var_1_20 [L90] var_1_21 = ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24))))) [L91] var_1_27 = ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28) [L92] var_1_38 = var_1_20 [L93] var_1_39 = 128 [L94] unsigned char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L95] COND FALSE !(var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) [L100] var_1_25 = 2u VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L102] COND FALSE !(\read(var_1_7)) [L109] var_1_16 = var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L111] signed long int stepLocal_5 = var_1_30 + var_1_39; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, stepLocal_5=128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L112] COND TRUE (var_1_25 - last_1_var_1_35) <= stepLocal_5 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L113] COND FALSE !(\read(var_1_7)) [L116] var_1_35 = ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L119] unsigned short int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_1=32, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L120] COND TRUE stepLocal_1 <= var_1_35 [L121] var_1_18 = (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L125] EXPR var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L125] COND FALSE !((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) [L130] var_1_29 = (var_1_28 - var_1_30) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L132] COND TRUE var_1_21 > var_1_29 [L133] var_1_6 = (var_1_21 - last_1_var_1_6) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=65, var_1_7=0, var_1_8=1, var_1_9=-128] [L213] RET step() [L214] CALL, EXPR property() [L204] EXPR last_1_var_1_16 | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=65, var_1_7=0, var_1_8=1, var_1_9=-128] [L204] EXPR (((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30)))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=65, var_1_7=0, var_1_8=1, var_1_9=-128] [L204-L205] return (((((((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30))))) && ((last_1_var_1_16 <= last_1_var_1_9) ? (var_1_33 == ((unsigned char) (var_1_34 - var_1_28))) : (((var_1_24 % var_1_34) >= last_1_var_1_27) ? (var_1_7 ? (var_1_33 == ((unsigned char) (((((((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) > ((64 - var_1_30))) ? (((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) : ((64 - var_1_30)))) + 1))) : (var_1_33 == ((unsigned char) var_1_28))) : 1))) && (((var_1_25 - last_1_var_1_35) <= (var_1_30 + var_1_39)) ? (var_1_7 ? (var_1_35 == ((unsigned char) var_1_28)) : (var_1_35 == ((unsigned char) ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24))))))) : 1)) && (var_1_38 == ((double) var_1_20))) && (var_1_39 == ((signed short int) 128)) ; [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=65, var_1_7=0, var_1_8=1, var_1_9=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=65, var_1_7=0, var_1_8=1, var_1_9=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.6s, OverallIterations: 10, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2444 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2421 mSDsluCounter, 6509 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5140 mSDsCounter, 975 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4276 IncrementalHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 975 mSolverCounterUnsat, 1369 mSDtfsCounter, 4276 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1281 GetRequests, 1083 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4359 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2444occurred in iteration=9, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1971 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 2654 NumberOfCodeBlocks, 2654 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2231 ConstructedInterpolants, 1 QuantifiedInterpolants, 14045 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1020 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 20133/20460 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:08:36,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_loopvsstraightlinecode_100-while_file-22.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 ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:08:38,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:08:39,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:08:39,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:08:39,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:08:39,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:08:39,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:08:39,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:08:39,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:08:39,097 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:08:39,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:08:39,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:08:39,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:08:39,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:08:39,103 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:08:39,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:08:39,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:08:39,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:08:39,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:08:39,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:08:39,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:08:39,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:08:39,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:08:39,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:08:39,107 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:08:39,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:08:39,107 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:08:39,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:08:39,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:08:39,108 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:08:39,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:08:39,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:08:39,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:08:39,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:08:39,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:08:39,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:08:39,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:08:39,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:08:39,112 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:08:39,112 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:08:39,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:08:39,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:08:39,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:08:39,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:08:39,114 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac [2024-11-12 05:08:39,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:08:39,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:08:39,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:08:39,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:08:39,479 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:08:39,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-12 05:08:41,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:08:41,341 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:08:41,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-12 05:08:41,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1990b1be/aac740d713154fac8622ab7575d578e3/FLAG3bdff37f3 [2024-11-12 05:08:41,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1990b1be/aac740d713154fac8622ab7575d578e3 [2024-11-12 05:08:41,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:08:41,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:08:41,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:08:41,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:08:41,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:08:41,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:41,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2def11f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41, skipping insertion in model container [2024-11-12 05:08:41,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:41,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:08:41,653 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_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-11-12 05:08:41,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:08:41,773 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:08:41,787 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_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-11-12 05:08:41,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:08:41,871 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:08:41,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41 WrapperNode [2024-11-12 05:08:41,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:08:41,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:08:41,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:08:41,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:08:41,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:41,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:41,939 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-12 05:08:41,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:08:41,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:08:41,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:08:41,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:08:41,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:41,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:41,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:41,994 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]. [2024-11-12 05:08:41,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:41,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:42,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:42,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:42,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:42,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:42,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:08:42,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:08:42,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:08:42,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:08:42,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (1/1) ... [2024-11-12 05:08:42,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:08:42,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:08:42,087 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) [2024-11-12 05:08:42,095 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 [2024-11-12 05:08:42,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:08:42,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:08:42,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:08:42,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:08:42,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:08:42,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:08:42,226 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:08:42,228 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:08:43,574 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 05:08:43,574 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:08:43,591 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:08:43,592 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:08:43,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:08:43 BoogieIcfgContainer [2024-11-12 05:08:43,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:08:43,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:08:43,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:08:43,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:08:43,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:08:41" (1/3) ... [2024-11-12 05:08:43,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a7ead5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:08:43, skipping insertion in model container [2024-11-12 05:08:43,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:08:41" (2/3) ... [2024-11-12 05:08:43,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a7ead5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:08:43, skipping insertion in model container [2024-11-12 05:08:43,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:08:43" (3/3) ... [2024-11-12 05:08:43,604 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-12 05:08:43,624 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:08:43,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:08:43,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:08:43,703 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2aef0dc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:08:43,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:08:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 05:08:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-12 05:08:43,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:43,733 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:43,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:43,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1852080997, now seen corresponding path program 1 times [2024-11-12 05:08:43,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:08:43,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845616078] [2024-11-12 05:08:43,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:43,760 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 [2024-11-12 05:08:43,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:08:43,764 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) [2024-11-12 05:08:43,766 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 [2024-11-12 05:08:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:44,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:08:44,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:08:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-12 05:08:44,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:08:44,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:08:44,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845616078] [2024-11-12 05:08:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845616078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:08:44,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:08:44,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:08:44,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098510346] [2024-11-12 05:08:44,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:08:44,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:08:44,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:08:44,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:08:44,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:08:44,141 INFO L87 Difference]: Start difference. First operand has 87 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-12 05:08:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:08:44,180 INFO L93 Difference]: Finished difference Result 167 states and 299 transitions. [2024-11-12 05:08:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:08:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 193 [2024-11-12 05:08:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:08:44,193 INFO L225 Difference]: With dead ends: 167 [2024-11-12 05:08:44,194 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 05:08:44,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:08:44,204 INFO L435 NwaCegarLoop]: 130 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, 130 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 [2024-11-12 05:08:44,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:08:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 05:08:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-12 05:08:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 05:08:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-11-12 05:08:44,265 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 193 [2024-11-12 05:08:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:08:44,265 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-11-12 05:08:44,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-12 05:08:44,266 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-11-12 05:08:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-12 05:08:44,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:44,289 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:44,300 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 [2024-11-12 05:08:44,489 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 [2024-11-12 05:08:44,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:44,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:44,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1107706983, now seen corresponding path program 1 times [2024-11-12 05:08:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:08:44,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158216306] [2024-11-12 05:08:44,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:44,493 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 [2024-11-12 05:08:44,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:08:44,495 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) [2024-11-12 05:08:44,496 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 [2024-11-12 05:08:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:44,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:08:44,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:08:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:08:46,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:08:46,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:08:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158216306] [2024-11-12 05:08:46,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158216306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:08:46,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:08:46,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:08:46,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375877586] [2024-11-12 05:08:46,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:08:46,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:08:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:08:46,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:08:46,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:08:46,322 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:08:48,164 INFO L93 Difference]: Finished difference Result 268 states and 423 transitions. [2024-11-12 05:08:48,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:08:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2024-11-12 05:08:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:08:48,183 INFO L225 Difference]: With dead ends: 268 [2024-11-12 05:08:48,183 INFO L226 Difference]: Without dead ends: 188 [2024-11-12 05:08:48,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:08:48,185 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 134 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 05:08:48,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 436 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 05:08:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-12 05:08:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 160. [2024-11-12 05:08:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 05:08:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 253 transitions. [2024-11-12 05:08:48,225 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 253 transitions. Word has length 193 [2024-11-12 05:08:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:08:48,227 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 253 transitions. [2024-11-12 05:08:48,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 253 transitions. [2024-11-12 05:08:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-12 05:08:48,231 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:48,231 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:48,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 05:08:48,431 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 [2024-11-12 05:08:48,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:48,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1598912411, now seen corresponding path program 1 times [2024-11-12 05:08:48,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:08:48,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745068452] [2024-11-12 05:08:48,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:48,435 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 [2024-11-12 05:08:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:08:48,437 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) [2024-11-12 05:08:48,438 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 [2024-11-12 05:08:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:48,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:08:48,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:08:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:08:49,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:08:49,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:08:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745068452] [2024-11-12 05:08:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745068452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:08:49,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:08:49,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:08:49,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696718700] [2024-11-12 05:08:49,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:08:49,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:08:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:08:49,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:08:49,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:08:49,896 INFO L87 Difference]: Start difference. First operand 160 states and 253 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:08:51,213 INFO L93 Difference]: Finished difference Result 321 states and 507 transitions. [2024-11-12 05:08:51,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:08:51,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2024-11-12 05:08:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:08:51,232 INFO L225 Difference]: With dead ends: 321 [2024-11-12 05:08:51,232 INFO L226 Difference]: Without dead ends: 164 [2024-11-12 05:08:51,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:08:51,234 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 75 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:08:51,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 361 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 05:08:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-12 05:08:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2024-11-12 05:08:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 05:08:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 215 transitions. [2024-11-12 05:08:51,278 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 215 transitions. Word has length 193 [2024-11-12 05:08:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:08:51,280 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 215 transitions. [2024-11-12 05:08:51,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 215 transitions. [2024-11-12 05:08:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-12 05:08:51,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:51,284 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:51,297 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 [2024-11-12 05:08:51,485 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 [2024-11-12 05:08:51,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:51,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash -7907848, now seen corresponding path program 1 times [2024-11-12 05:08:51,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:08:51,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318514993] [2024-11-12 05:08:51,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:51,487 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 [2024-11-12 05:08:51,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:08:51,490 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) [2024-11-12 05:08:51,491 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 [2024-11-12 05:08:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:51,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:08:51,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:08:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:08:52,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:08:52,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:08:52,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318514993] [2024-11-12 05:08:52,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318514993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:08:52,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:08:52,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:08:52,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687785048] [2024-11-12 05:08:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:08:52,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:08:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:08:52,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:08:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:08:52,107 INFO L87 Difference]: Start difference. First operand 138 states and 215 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:08:53,450 INFO L93 Difference]: Finished difference Result 244 states and 383 transitions. [2024-11-12 05:08:53,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:08:53,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194 [2024-11-12 05:08:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:08:53,477 INFO L225 Difference]: With dead ends: 244 [2024-11-12 05:08:53,477 INFO L226 Difference]: Without dead ends: 164 [2024-11-12 05:08:53,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:08:53,480 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 63 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:08:53,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 490 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 05:08:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-12 05:08:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2024-11-12 05:08:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 05:08:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 219 transitions. [2024-11-12 05:08:53,518 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 219 transitions. Word has length 194 [2024-11-12 05:08:53,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:08:53,519 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 219 transitions. [2024-11-12 05:08:53,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 219 transitions. [2024-11-12 05:08:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-12 05:08:53,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:53,522 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:53,538 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 05:08:53,723 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 [2024-11-12 05:08:53,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:53,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:53,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1348572340, now seen corresponding path program 1 times [2024-11-12 05:08:53,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:08:53,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851094106] [2024-11-12 05:08:53,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:53,727 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 [2024-11-12 05:08:53,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:08:53,729 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) [2024-11-12 05:08:53,731 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 [2024-11-12 05:08:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:53,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:08:53,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:08:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:08:54,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:08:54,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:08:54,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851094106] [2024-11-12 05:08:54,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851094106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:08:54,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:08:54,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:08:54,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138970114] [2024-11-12 05:08:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:08:54,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:08:54,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:08:54,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:08:54,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:08:54,267 INFO L87 Difference]: Start difference. First operand 141 states and 219 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:55,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:08:55,609 INFO L93 Difference]: Finished difference Result 332 states and 518 transitions. [2024-11-12 05:08:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:08:55,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-11-12 05:08:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:08:55,626 INFO L225 Difference]: With dead ends: 332 [2024-11-12 05:08:55,626 INFO L226 Difference]: Without dead ends: 252 [2024-11-12 05:08:55,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:08:55,628 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 170 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:08:55,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 431 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 05:08:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-12 05:08:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 222. [2024-11-12 05:08:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 125 states have (on average 1.304) internal successors, (163), 125 states have internal predecessors, (163), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-12 05:08:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 349 transitions. [2024-11-12 05:08:55,683 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 349 transitions. Word has length 195 [2024-11-12 05:08:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:08:55,685 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 349 transitions. [2024-11-12 05:08:55,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 349 transitions. [2024-11-12 05:08:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-12 05:08:55,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:55,687 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:55,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 05:08:55,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:08:55,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:55,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash -807090980, now seen corresponding path program 1 times [2024-11-12 05:08:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:08:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929224490] [2024-11-12 05:08:55,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:55,893 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 [2024-11-12 05:08:55,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:08:55,897 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2024-11-12 05:08:55,898 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 (7)] Waiting until timeout for monitored process [2024-11-12 05:08:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:56,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:08:56,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:08:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 148 proven. 87 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2024-11-12 05:08:56,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:08:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 05:08:56,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:08:56,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929224490] [2024-11-12 05:08:56,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929224490] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 05:08:56,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:08:56,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-12 05:08:56,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64808830] [2024-11-12 05:08:56,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:08:56,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:08:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:08:56,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:08:56,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:08:56,612 INFO L87 Difference]: Start difference. First operand 222 states and 349 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:08:58,184 INFO L93 Difference]: Finished difference Result 436 states and 688 transitions. [2024-11-12 05:08:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:08:58,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-11-12 05:08:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:08:58,200 INFO L225 Difference]: With dead ends: 436 [2024-11-12 05:08:58,200 INFO L226 Difference]: Without dead ends: 275 [2024-11-12 05:08:58,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:08:58,203 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 69 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 05:08:58,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 266 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 05:08:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-12 05:08:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 238. [2024-11-12 05:08:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-12 05:08:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 371 transitions. [2024-11-12 05:08:58,247 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 371 transitions. Word has length 196 [2024-11-12 05:08:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:08:58,248 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 371 transitions. [2024-11-12 05:08:58,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 05:08:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 371 transitions. [2024-11-12 05:08:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-12 05:08:58,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:08:58,254 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:08:58,264 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 (7)] Forceful destruction successful, exit code 0 [2024-11-12 05:08:58,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 [2024-11-12 05:08:58,455 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:08:58,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:08:58,455 INFO L85 PathProgramCache]: Analyzing trace with hash -548925542, now seen corresponding path program 1 times [2024-11-12 05:08:58,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:08:58,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442912101] [2024-11-12 05:08:58,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:08:58,456 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 [2024-11-12 05:08:58,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:08:58,459 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:08:58,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 05:08:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:08:58,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 05:08:58,622 INFO L279 TraceCheckSpWp]: Computing forward predicates...