./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_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-1loop_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 b3751a2ceaae8972d788d7195cbb1b12ec209633513efd66a5d0e24c48ee8e17 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:56:32,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:56:32,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:56:32,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:56:32,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:56:32,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:56:32,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:56:32,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:56:32,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:56:32,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:56:32,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:56:32,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:56:32,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:56:32,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:56:32,135 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:56:32,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:56:32,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:56:32,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:56:32,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:56:32,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:56:32,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:56:32,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:56:32,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:56:32,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:56:32,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:56:32,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:56:32,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:56:32,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:56:32,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:56:32,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:56:32,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:56:32,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:56:32,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:56:32,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:56:32,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:56:32,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:56:32,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:56:32,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:56:32,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:56:32,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:56:32,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:56:32,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:56:32,149 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 -> b3751a2ceaae8972d788d7195cbb1b12ec209633513efd66a5d0e24c48ee8e17 [2024-11-12 04:56:32,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:56:32,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:56:32,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:56:32,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:56:32,445 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:56:32,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i [2024-11-12 04:56:34,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:56:34,315 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:56:34,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i [2024-11-12 04:56:34,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b2aa09d/c5e67679235d47bdaeb8c3791a0aeedd/FLAG658b8a32b [2024-11-12 04:56:34,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b2aa09d/c5e67679235d47bdaeb8c3791a0aeedd [2024-11-12 04:56:34,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:56:34,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:56:34,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:56:34,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:56:34,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:56:34,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:56:34" (1/1) ... [2024-11-12 04:56:34,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d840f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:34, skipping insertion in model container [2024-11-12 04:56:34,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:56:34" (1/1) ... [2024-11-12 04:56:34,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:56:34,877 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-1loop_file-22.i[916,929] [2024-11-12 04:56:34,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:56:35,002 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:56:35,013 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-1loop_file-22.i[916,929] [2024-11-12 04:56:35,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:56:35,097 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:56:35,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35 WrapperNode [2024-11-12 04:56:35,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:56:35,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:56:35,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:56:35,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:56:35,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,226 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 262 [2024-11-12 04:56:35,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:56:35,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:56:35,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:56:35,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:56:35,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,282 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 04:56:35,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:56:35,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:56:35,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:56:35,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:56:35,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (1/1) ... [2024-11-12 04:56:35,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:56:35,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:56:35,393 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 04:56:35,400 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 04:56:35,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:56:35,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:56:35,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:56:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:56:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:56:35,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:56:35,561 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:56:35,563 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:56:36,132 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-12 04:56:36,132 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:56:36,151 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:56:36,152 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:56:36,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:36 BoogieIcfgContainer [2024-11-12 04:56:36,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:56:36,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:56:36,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:56:36,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:56:36,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:56:34" (1/3) ... [2024-11-12 04:56:36,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338925c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:56:36, skipping insertion in model container [2024-11-12 04:56:36,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:35" (2/3) ... [2024-11-12 04:56:36,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338925c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:56:36, skipping insertion in model container [2024-11-12 04:56:36,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:36" (3/3) ... [2024-11-12 04:56:36,163 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-22.i [2024-11-12 04:56:36,181 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:56:36,182 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:56:36,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:56:36,267 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;@6957f4bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:56:36,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:56:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 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 04:56:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-12 04:56:36,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:36,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, 1, 1, 1, 1, 1, 1] [2024-11-12 04:56:36,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:36,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1387971925, now seen corresponding path program 1 times [2024-11-12 04:56:36,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:36,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542917752] [2024-11-12 04:56:36,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:36,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:56:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:56:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:56:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:56:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:56:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:56:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:56:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:56:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:56:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:56:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:56:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:56:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:56:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:56:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:56:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:56:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:36,920 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 04:56:36,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:36,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542917752] [2024-11-12 04:56:36,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542917752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:36,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:36,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:56:36,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337046086] [2024-11-12 04:56:36,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:36,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:56:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:36,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:56:36,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:56:36,995 INFO L87 Difference]: Start difference. First operand has 102 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-12 04:56:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:37,032 INFO L93 Difference]: Finished difference Result 201 states and 346 transitions. [2024-11-12 04:56:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:56:37,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2024-11-12 04:56:37,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:37,048 INFO L225 Difference]: With dead ends: 201 [2024-11-12 04:56:37,049 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 04:56:37,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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 04:56:37,059 INFO L435 NwaCegarLoop]: 156 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, 156 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 04:56:37,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:56:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 04:56:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 04:56:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 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 04:56:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2024-11-12 04:56:37,121 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 199 [2024-11-12 04:56:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:37,122 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2024-11-12 04:56:37,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-12 04:56:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2024-11-12 04:56:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-12 04:56:37,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:37,130 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 04:56:37,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:56:37,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:37,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:37,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2137083347, now seen corresponding path program 1 times [2024-11-12 04:56:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780277070] [2024-11-12 04:56:37,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:56:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:56:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:56:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:56:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:56:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:56:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:56:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:56:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:56:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:56:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:56:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:56:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:56:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:56:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:56:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:56:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:37,858 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 04:56:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780277070] [2024-11-12 04:56:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780277070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:37,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:37,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:56:37,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794536174] [2024-11-12 04:56:37,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:37,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:56:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:37,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:56:37,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:56:37,866 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. 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 04:56:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:38,304 INFO L93 Difference]: Finished difference Result 325 states and 506 transitions. [2024-11-12 04:56:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:56:38,306 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 04:56:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:38,311 INFO L225 Difference]: With dead ends: 325 [2024-11-12 04:56:38,311 INFO L226 Difference]: Without dead ends: 230 [2024-11-12 04:56:38,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:56:38,313 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 203 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:38,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 609 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:56:38,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-12 04:56:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2024-11-12 04:56:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 149 states have (on average 1.4161073825503356) internal successors, (211), 149 states have internal predecessors, (211), 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 04:56:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 335 transitions. [2024-11-12 04:56:38,367 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 335 transitions. Word has length 199 [2024-11-12 04:56:38,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:38,368 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 335 transitions. [2024-11-12 04:56:38,369 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 04:56:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 335 transitions. [2024-11-12 04:56:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-12 04:56:38,372 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:38,372 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 04:56:38,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:56:38,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:38,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash -375765902, now seen corresponding path program 1 times [2024-11-12 04:56:38,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:38,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413332882] [2024-11-12 04:56:38,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:38,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:56:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:56:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:56:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:56:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:56:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:56:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:56:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:56:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:56:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:56:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:56:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:56:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:56:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:56:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:56:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:56:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:38,871 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 04:56:38,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:38,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413332882] [2024-11-12 04:56:38,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413332882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:38,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:38,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:56:38,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110379228] [2024-11-12 04:56:38,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:38,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:56:38,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:38,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:56:38,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:56:38,874 INFO L87 Difference]: Start difference. First operand 214 states and 335 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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 04:56:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:39,292 INFO L93 Difference]: Finished difference Result 575 states and 892 transitions. [2024-11-12 04:56:39,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:56:39,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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 04:56:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:39,298 INFO L225 Difference]: With dead ends: 575 [2024-11-12 04:56:39,298 INFO L226 Difference]: Without dead ends: 364 [2024-11-12 04:56:39,300 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 04:56:39,301 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 185 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:39,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 646 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:56:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-12 04:56:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 307. [2024-11-12 04:56:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 210 states have (on average 1.3952380952380952) internal successors, (293), 210 states have internal predecessors, (293), 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 04:56:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 479 transitions. [2024-11-12 04:56:39,361 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 479 transitions. Word has length 200 [2024-11-12 04:56:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:39,363 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 479 transitions. [2024-11-12 04:56:39,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 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 04:56:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 479 transitions. [2024-11-12 04:56:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-12 04:56:39,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:39,367 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 04:56:39,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:56:39,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:39,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:39,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2113763060, now seen corresponding path program 1 times [2024-11-12 04:56:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:39,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680522727] [2024-11-12 04:56:39,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:39,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:56:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:56:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:56:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:56:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:56:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:56:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:56:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:56:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:56:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:56:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:56:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:56:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:56:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:56:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:56:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:56:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:39,952 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 04:56:39,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:39,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680522727] [2024-11-12 04:56:39,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680522727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:39,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:39,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:56:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678927774] [2024-11-12 04:56:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:39,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:56:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:39,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:56:39,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:56:39,954 INFO L87 Difference]: Start difference. First operand 307 states and 479 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 04:56:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:40,223 INFO L93 Difference]: Finished difference Result 759 states and 1178 transitions. [2024-11-12 04:56:40,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:56:40,223 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 04:56:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:40,231 INFO L225 Difference]: With dead ends: 759 [2024-11-12 04:56:40,231 INFO L226 Difference]: Without dead ends: 455 [2024-11-12 04:56:40,232 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 04:56:40,233 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 121 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 407 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 04:56:40,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 407 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:56:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-12 04:56:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 414. [2024-11-12 04:56:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 285 states have (on average 1.407017543859649) internal successors, (401), 285 states have internal predecessors, (401), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-12 04:56:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 649 transitions. [2024-11-12 04:56:40,306 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 649 transitions. Word has length 200 [2024-11-12 04:56:40,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:40,306 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 649 transitions. [2024-11-12 04:56:40,307 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 04:56:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 649 transitions. [2024-11-12 04:56:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-12 04:56:40,310 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:40,310 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 04:56:40,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:56:40,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:40,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:40,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1955564562, now seen corresponding path program 1 times [2024-11-12 04:56:40,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:40,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342042129] [2024-11-12 04:56:40,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:40,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:56:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:56:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:56:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:56:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:56:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:56:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:56:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:56:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:56:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:56:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:56:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:56:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:56:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:56:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:56:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:56:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:40,766 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 04:56:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342042129] [2024-11-12 04:56:40,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342042129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:40,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:40,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:56:40,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522335963] [2024-11-12 04:56:40,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:40,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:56:40,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:40,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:56:40,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:56:40,771 INFO L87 Difference]: Start difference. First operand 414 states and 649 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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 04:56:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:41,114 INFO L93 Difference]: Finished difference Result 825 states and 1287 transitions. [2024-11-12 04:56:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:56:41,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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 04:56:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:41,118 INFO L225 Difference]: With dead ends: 825 [2024-11-12 04:56:41,118 INFO L226 Difference]: Without dead ends: 471 [2024-11-12 04:56:41,120 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 04:56:41,124 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 179 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 651 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.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:41,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 651 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:56:41,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-12 04:56:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 413. [2024-11-12 04:56:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 284 states have (on average 1.4014084507042253) internal successors, (398), 284 states have internal predecessors, (398), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-12 04:56:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 646 transitions. [2024-11-12 04:56:41,184 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 646 transitions. Word has length 204 [2024-11-12 04:56:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:41,185 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 646 transitions. [2024-11-12 04:56:41,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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 04:56:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 646 transitions. [2024-11-12 04:56:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-12 04:56:41,187 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:41,187 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 04:56:41,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:56:41,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:41,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:41,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2096113172, now seen corresponding path program 1 times [2024-11-12 04:56:41,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:41,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924699447] [2024-11-12 04:56:41,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:56:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:56:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:56:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:56:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:56:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:56:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:56:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:56:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:56:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:56:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:56:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:56:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:56:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:56:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:56:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:56:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:42,947 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 04:56:42,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924699447] [2024-11-12 04:56:42,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924699447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:42,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:42,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:56:42,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567158328] [2024-11-12 04:56:42,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:42,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:56:42,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:42,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:56:42,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:56:42,949 INFO L87 Difference]: Start difference. First operand 413 states and 646 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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 04:56:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:43,345 INFO L93 Difference]: Finished difference Result 1063 states and 1664 transitions. [2024-11-12 04:56:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:56:43,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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 04:56:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:43,352 INFO L225 Difference]: With dead ends: 1063 [2024-11-12 04:56:43,352 INFO L226 Difference]: Without dead ends: 740 [2024-11-12 04:56:43,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:56:43,354 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 83 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:43,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 538 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:56:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-11-12 04:56:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 734. [2024-11-12 04:56:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 509 states have (on average 1.3929273084479372) internal successors, (709), 509 states have internal predecessors, (709), 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 04:56:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1143 transitions. [2024-11-12 04:56:43,434 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1143 transitions. Word has length 204 [2024-11-12 04:56:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:43,435 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1143 transitions. [2024-11-12 04:56:43,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 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 04:56:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1143 transitions. [2024-11-12 04:56:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-12 04:56:43,437 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:43,438 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 04:56:43,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:56:43,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:43,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1084995922, now seen corresponding path program 1 times [2024-11-12 04:56:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:43,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972303790] [2024-11-12 04:56:43,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:43,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:43,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:43,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:43,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:56:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:43,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:43,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:56:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:56:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:56:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:56:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:56:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:56:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:56:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:56:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:56:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:56:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:56:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:56:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:56:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:56:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:56:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,069 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 04:56:44,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:44,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972303790] [2024-11-12 04:56:44,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972303790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:44,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:44,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:56:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128403635] [2024-11-12 04:56:44,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:44,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:56:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:44,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:56:44,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:56:44,073 INFO L87 Difference]: Start difference. First operand 734 states and 1143 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 04:56:44,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:44,358 INFO L93 Difference]: Finished difference Result 1800 states and 2799 transitions. [2024-11-12 04:56:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:56:44,360 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 04:56:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:44,370 INFO L225 Difference]: With dead ends: 1800 [2024-11-12 04:56:44,371 INFO L226 Difference]: Without dead ends: 1176 [2024-11-12 04:56:44,373 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 04:56:44,374 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 225 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 518 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 04:56:44,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 518 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:56:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-11-12 04:56:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 964. [2024-11-12 04:56:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 675 states have (on average 1.4014814814814816) internal successors, (946), 675 states have internal predecessors, (946), 279 states have call successors, (279), 9 states have call predecessors, (279), 9 states have return successors, (279), 279 states have call predecessors, (279), 279 states have call successors, (279) [2024-11-12 04:56:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1504 transitions. [2024-11-12 04:56:44,501 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1504 transitions. Word has length 204 [2024-11-12 04:56:44,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:44,523 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1504 transitions. [2024-11-12 04:56:44,524 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 04:56:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1504 transitions. [2024-11-12 04:56:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-12 04:56:44,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:44,526 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 04:56:44,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:56:44,526 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:44,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash -69560815, now seen corresponding path program 1 times [2024-11-12 04:56:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147068959] [2024-11-12 04:56:44,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:56:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:56:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:56:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:56:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:56:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:56:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:56:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:56:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:56:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:56:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:56:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:56:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:56:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:56:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:56:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:56:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:44,964 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 04:56:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:44,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147068959] [2024-11-12 04:56:44,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147068959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:44,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:44,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:56:44,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890501159] [2024-11-12 04:56:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:44,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:56:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:44,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:56:44,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:56:44,966 INFO L87 Difference]: Start difference. First operand 964 states and 1504 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 04:56:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:45,139 INFO L93 Difference]: Finished difference Result 2375 states and 3704 transitions. [2024-11-12 04:56:45,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:56:45,140 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 04:56:45,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:45,149 INFO L225 Difference]: With dead ends: 2375 [2024-11-12 04:56:45,150 INFO L226 Difference]: Without dead ends: 1495 [2024-11-12 04:56:45,153 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 04:56:45,154 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 88 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 504 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 04:56:45,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 504 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:56:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-12 04:56:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1066. [2024-11-12 04:56:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 777 states have (on average 1.398970398970399) internal successors, (1087), 777 states have internal predecessors, (1087), 279 states have call successors, (279), 9 states have call predecessors, (279), 9 states have return successors, (279), 279 states have call predecessors, (279), 279 states have call successors, (279) [2024-11-12 04:56:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1645 transitions. [2024-11-12 04:56:45,279 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1645 transitions. Word has length 205 [2024-11-12 04:56:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:45,279 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1645 transitions. [2024-11-12 04:56:45,279 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 04:56:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1645 transitions. [2024-11-12 04:56:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-12 04:56:45,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:56:45,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 04:56:45,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:45,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:45,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1758504557, now seen corresponding path program 1 times [2024-11-12 04:56:45,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:45,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310438100] [2024-11-12 04:56:45,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:56:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:56:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:56:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:56:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:56:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:56:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:56:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:56:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:56:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:56:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:56:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:56:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:56:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:56:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:56:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:56:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:46,835 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 04:56:46,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:46,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310438100] [2024-11-12 04:56:46,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310438100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:56:46,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044732289] [2024-11-12 04:56:46,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:46,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:56:46,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:56:46,838 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 04:56:46,840 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 04:56:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:47,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 04:56:47,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:56:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 869 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 04:56:48,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:56:50,655 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 04:56:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044732289] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:56:50,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:56:50,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 30 [2024-11-12 04:56:50,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211258470] [2024-11-12 04:56:50,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:56:50,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-12 04:56:50,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:50,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 04:56:50,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2024-11-12 04:56:50,661 INFO L87 Difference]: Start difference. First operand 1066 states and 1645 transitions. Second operand has 30 states, 29 states have (on average 5.068965517241379) internal successors, (147), 30 states have internal predecessors, (147), 9 states have call successors, (93), 4 states have call predecessors, (93), 8 states have return successors, (93), 8 states have call predecessors, (93), 9 states have call successors, (93) [2024-11-12 04:56:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:53,559 INFO L93 Difference]: Finished difference Result 3732 states and 5634 transitions. [2024-11-12 04:56:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-12 04:56:53,560 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.068965517241379) internal successors, (147), 30 states have internal predecessors, (147), 9 states have call successors, (93), 4 states have call predecessors, (93), 8 states have return successors, (93), 8 states have call predecessors, (93), 9 states have call successors, (93) Word has length 205 [2024-11-12 04:56:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:53,576 INFO L225 Difference]: With dead ends: 3732 [2024-11-12 04:56:53,576 INFO L226 Difference]: Without dead ends: 2812 [2024-11-12 04:56:53,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=604, Invalid=1846, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 04:56:53,582 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 768 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:53,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1691 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 04:56:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2024-11-12 04:56:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2200. [2024-11-12 04:56:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 1557 states have (on average 1.359666024405909) internal successors, (2117), 1565 states have internal predecessors, (2117), 602 states have call successors, (602), 40 states have call predecessors, (602), 40 states have return successors, (602), 594 states have call predecessors, (602), 602 states have call successors, (602) [2024-11-12 04:56:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 3321 transitions. [2024-11-12 04:56:53,872 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 3321 transitions. Word has length 205 [2024-11-12 04:56:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:53,873 INFO L471 AbstractCegarLoop]: Abstraction has 2200 states and 3321 transitions. [2024-11-12 04:56:53,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.068965517241379) internal successors, (147), 30 states have internal predecessors, (147), 9 states have call successors, (93), 4 states have call predecessors, (93), 8 states have return successors, (93), 8 states have call predecessors, (93), 9 states have call successors, (93) [2024-11-12 04:56:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 3321 transitions. [2024-11-12 04:56:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-12 04:56:53,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:53,876 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 04:56:53,897 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 04:56:54,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:56:54,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:54,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:54,079 INFO L85 PathProgramCache]: Analyzing trace with hash -202770368, now seen corresponding path program 1 times [2024-11-12 04:56:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:54,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934506387] [2024-11-12 04:56:54,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:54,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:56:54,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [907207979] [2024-11-12 04:56:54,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:54,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:56:54,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:56:54,378 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 04:56:54,380 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 04:56:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:54,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-12 04:56:54,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:56:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1505 proven. 168 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-12 04:56:59,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:57:12,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:57:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934506387] [2024-11-12 04:57:12,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 04:57:12,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907207979] [2024-11-12 04:57:12,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907207979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:57:12,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 04:57:12,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2024-11-12 04:57:12,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484924149] [2024-11-12 04:57:12,532 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 04:57:12,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-12 04:57:12,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:57:12,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-12 04:57:12,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=2664, Unknown=1, NotChecked=0, Total=3192 [2024-11-12 04:57:12,535 INFO L87 Difference]: Start difference. First operand 2200 states and 3321 transitions. Second operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 43 states have internal predecessors, (101), 12 states have call successors, (31), 12 states have call predecessors, (31), 17 states have return successors, (31), 13 states have call predecessors, (31), 12 states have call successors, (31) [2024-11-12 04:57:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:57:16,962 INFO L93 Difference]: Finished difference Result 3961 states and 5748 transitions. [2024-11-12 04:57:16,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-12 04:57:16,963 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 43 states have internal predecessors, (101), 12 states have call successors, (31), 12 states have call predecessors, (31), 17 states have return successors, (31), 13 states have call predecessors, (31), 12 states have call successors, (31) Word has length 205 [2024-11-12 04:57:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:57:16,985 INFO L225 Difference]: With dead ends: 3961 [2024-11-12 04:57:16,986 INFO L226 Difference]: Without dead ends: 3606 [2024-11-12 04:57:16,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1915, Invalid=9426, Unknown=1, NotChecked=0, Total=11342 [2024-11-12 04:57:16,992 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 567 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 2598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 04:57:16,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 2026 Invalid, 2598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 04:57:16,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2024-11-12 04:57:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3033. [2024-11-12 04:57:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 2175 states have (on average 1.3255172413793104) internal successors, (2883), 2201 states have internal predecessors, (2883), 785 states have call successors, (785), 72 states have call predecessors, (785), 72 states have return successors, (785), 759 states have call predecessors, (785), 785 states have call successors, (785) [2024-11-12 04:57:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 4453 transitions. [2024-11-12 04:57:17,396 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 4453 transitions. Word has length 205 [2024-11-12 04:57:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:57:17,397 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 4453 transitions. [2024-11-12 04:57:17,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 43 states have internal predecessors, (101), 12 states have call successors, (31), 12 states have call predecessors, (31), 17 states have return successors, (31), 13 states have call predecessors, (31), 12 states have call successors, (31) [2024-11-12 04:57:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 4453 transitions. [2024-11-12 04:57:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-12 04:57:17,401 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:57:17,401 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 04:57:17,421 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 04:57:17,605 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,SelfDestructingSolverStorable9 [2024-11-12 04:57:17,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:57:17,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:57:17,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1213887618, now seen corresponding path program 1 times [2024-11-12 04:57:17,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:57:17,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447061553] [2024-11-12 04:57:17,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:57:17,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:57:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:57:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:57:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:57:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:57:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:57:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:57:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:57:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:57:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:57:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:57:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:57:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:57:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:57:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:57:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:57:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:57:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:57:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:57:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:57:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:57:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:57:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:57:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:57:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:57:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:57:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:57:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:57:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:57:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:57:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:57:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:57:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 492 proven. 60 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2024-11-12 04:57:19,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:57:19,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447061553] [2024-11-12 04:57:19,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447061553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:57:19,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730763538] [2024-11-12 04:57:19,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:57:19,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:57:19,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:57:19,853 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 04:57:19,854 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 04:57:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:20,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-12 04:57:20,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:57:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1184 proven. 126 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-12 04:57:21,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:57:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730763538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:57:22,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:57:22,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28] total 40 [2024-11-12 04:57:22,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123989998] [2024-11-12 04:57:22,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:57:22,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-12 04:57:22,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:57:22,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-12 04:57:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1765, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 04:57:22,994 INFO L87 Difference]: Start difference. First operand 3033 states and 4453 transitions. Second operand has 40 states, 37 states have (on average 3.027027027027027) internal successors, (112), 33 states have internal predecessors, (112), 14 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (62), 16 states have call predecessors, (62), 14 states have call successors, (62) [2024-11-12 04:57:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:57:27,208 INFO L93 Difference]: Finished difference Result 5695 states and 8006 transitions. [2024-11-12 04:57:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-12 04:57:27,209 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 3.027027027027027) internal successors, (112), 33 states have internal predecessors, (112), 14 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (62), 16 states have call predecessors, (62), 14 states have call successors, (62) Word has length 205 [2024-11-12 04:57:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:57:27,242 INFO L225 Difference]: With dead ends: 5695 [2024-11-12 04:57:27,242 INFO L226 Difference]: Without dead ends: 4952 [2024-11-12 04:57:27,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1584, Invalid=5726, Unknown=0, NotChecked=0, Total=7310 [2024-11-12 04:57:27,252 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 781 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:57:27,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2260 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 04:57:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4952 states. [2024-11-12 04:57:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4952 to 4395. [2024-11-12 04:57:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4395 states, 3158 states have (on average 1.2970234325522483) internal successors, (4096), 3189 states have internal predecessors, (4096), 1033 states have call successors, (1033), 203 states have call predecessors, (1033), 203 states have return successors, (1033), 1002 states have call predecessors, (1033), 1033 states have call successors, (1033) [2024-11-12 04:57:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6162 transitions. [2024-11-12 04:57:27,780 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6162 transitions. Word has length 205 [2024-11-12 04:57:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:57:27,781 INFO L471 AbstractCegarLoop]: Abstraction has 4395 states and 6162 transitions. [2024-11-12 04:57:27,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 3.027027027027027) internal successors, (112), 33 states have internal predecessors, (112), 14 states have call successors, (62), 9 states have call predecessors, (62), 13 states have return successors, (62), 16 states have call predecessors, (62), 14 states have call successors, (62) [2024-11-12 04:57:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6162 transitions. [2024-11-12 04:57:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-12 04:57:27,784 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:57:27,785 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 04:57:27,803 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 04:57:27,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:57:27,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:57:27,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:57:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash 818297986, now seen corresponding path program 1 times [2024-11-12 04:57:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:57:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501068623] [2024-11-12 04:57:27,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:57:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:57:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:57:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:57:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:57:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:57:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:57:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:57:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:57:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:57:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:57:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:57:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:57:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:57:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:57:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:57:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:57:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:57:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:57:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:57:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:57:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 04:57:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:57:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 04:57:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:57:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 04:57:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:57:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 04:57:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 04:57:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 04:57:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 04:57:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 04:57:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 04:57:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:28,117 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 04:57:28,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:57:28,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501068623] [2024-11-12 04:57:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501068623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:57:28,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:57:28,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:57:28,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008322786] [2024-11-12 04:57:28,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:57:28,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:57:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:57:28,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:57:28,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:57:28,120 INFO L87 Difference]: Start difference. First operand 4395 states and 6162 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 04:57:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:57:28,625 INFO L93 Difference]: Finished difference Result 9311 states and 13095 transitions. [2024-11-12 04:57:28,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:57:28,626 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 04:57:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:57:28,657 INFO L225 Difference]: With dead ends: 9311 [2024-11-12 04:57:28,658 INFO L226 Difference]: Without dead ends: 5385 [2024-11-12 04:57:28,670 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 04:57:28,670 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 41 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 292 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.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:57:28,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 292 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:57:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5385 states. [2024-11-12 04:57:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5385 to 4810. [2024-11-12 04:57:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 3573 states have (on average 1.3101035544360482) internal successors, (4681), 3604 states have internal predecessors, (4681), 1033 states have call successors, (1033), 203 states have call predecessors, (1033), 203 states have return successors, (1033), 1002 states have call predecessors, (1033), 1033 states have call successors, (1033) [2024-11-12 04:57:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 6747 transitions. [2024-11-12 04:57:29,240 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 6747 transitions. Word has length 205 [2024-11-12 04:57:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:57:29,243 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 6747 transitions. [2024-11-12 04:57:29,243 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 04:57:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 6747 transitions. [2024-11-12 04:57:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-12 04:57:29,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:57:29,247 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 04:57:29,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 04:57:29,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:57:29,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:57:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash 214668182, now seen corresponding path program 1 times [2024-11-12 04:57:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:57:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087533649] [2024-11-12 04:57:29,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:57:29,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:57:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:57:29,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124449540] [2024-11-12 04:57:29,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:57:29,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:57:29,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:57:29,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:57:29,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 04:57:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:57:29,603 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:57:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:57:29,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:57:29,840 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:57:29,841 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:57:29,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 04:57:30,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:57:30,046 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:57:30,204 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:57:30,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:57:30 BoogieIcfgContainer [2024-11-12 04:57:30,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:57:30,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:57:30,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:57:30,208 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:57:30,208 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:36" (3/4) ... [2024-11-12 04:57:30,210 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:57:30,211 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:57:30,212 INFO L158 Benchmark]: Toolchain (without parser) took 55573.14ms. Allocated memory was 142.6MB in the beginning and 992.0MB in the end (delta: 849.3MB). Free memory was 71.4MB in the beginning and 743.1MB in the end (delta: -671.7MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. [2024-11-12 04:57:30,212 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:57:30,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.03ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 52.1MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 04:57:30,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.73ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 51.9MB in the beginning and 150.4MB in the end (delta: -98.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-12 04:57:30,213 INFO L158 Benchmark]: Boogie Preprocessor took 127.84ms. Allocated memory is still 182.5MB. Free memory was 150.4MB in the beginning and 138.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 04:57:30,213 INFO L158 Benchmark]: RCFGBuilder took 796.98ms. Allocated memory is still 182.5MB. Free memory was 138.8MB in the beginning and 103.2MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-12 04:57:30,214 INFO L158 Benchmark]: TraceAbstraction took 54050.70ms. Allocated memory was 182.5MB in the beginning and 992.0MB in the end (delta: 809.5MB). Free memory was 102.2MB in the beginning and 743.1MB in the end (delta: -641.0MB). Peak memory consumption was 169.5MB. Max. memory is 16.1GB. [2024-11-12 04:57:30,214 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 992.0MB. Free memory is still 743.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:57:30,215 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 142.6MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.03ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 52.1MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 127.73ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 51.9MB in the beginning and 150.4MB in the end (delta: -98.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.84ms. Allocated memory is still 182.5MB. Free memory was 150.4MB in the beginning and 138.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 796.98ms. Allocated memory is still 182.5MB. Free memory was 138.8MB in the beginning and 103.2MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 54050.70ms. Allocated memory was 182.5MB in the beginning and 992.0MB in the end (delta: 809.5MB). Free memory was 102.2MB in the beginning and 743.1MB in the end (delta: -641.0MB). Peak memory consumption was 169.5MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 992.0MB. Free memory is still 743.1MB. 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] int k_loop; [L211] k_loop = 0 VAL [isInitial=1, k_loop=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] [L211] COND TRUE k_loop < 1 [L212] 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] [L212] RET updateLastVariables() [L213] 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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] [L213] RET updateVariables() [L214] 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, 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=-322, 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=319, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=2, var_1_36=-322, 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=319, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=2, var_1_36=-322, 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=319, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=2, var_1_36=-322, 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=319, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=2, var_1_36=-322, 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=319, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=2, var_1_36=-322, 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=319, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=2, var_1_36=-322, 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=319, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=65, var_1_36=-322, 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=319, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=65, var_1_36=-322, 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=319, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=65, var_1_36=-322, 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=319, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=65, var_1_36=-322, 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=319, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=65, var_1_36=-322, 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=319, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=65, var_1_36=-322, 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] [L214] RET step() [L215] 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=319, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=65, var_1_36=-322, 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=319, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=65, var_1_36=-322, 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)) ; [L215] RET, EXPR property() [L215] 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=319, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=65, var_1_36=-322, 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=319, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=319, var_1_34=127, var_1_35=65, var_1_36=-322, 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, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.8s, OverallIterations: 13, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3289 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3241 mSDsluCounter, 10298 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8362 mSDsCounter, 1517 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7632 IncrementalHoareTripleChecker+Invalid, 9149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1517 mSolverCounterUnsat, 1936 mSDtfsCounter, 7632 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1811 GetRequests, 1536 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 5085 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4810occurred in iteration=12, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 3136 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 3462 NumberOfCodeBlocks, 3462 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3035 ConstructedInterpolants, 1 QuantifiedInterpolants, 19343 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1538 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 27447/27900 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 04:57:30,368 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-1loop_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 b3751a2ceaae8972d788d7195cbb1b12ec209633513efd66a5d0e24c48ee8e17 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:57:32,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:57:32,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:57:32,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:57:32,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:57:32,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:57:32,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:57:32,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:57:32,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:57:32,669 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:57:32,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:57:32,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:57:32,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:57:32,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:57:32,673 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:57:32,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:57:32,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:57:32,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:57:32,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:57:32,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:57:32,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:57:32,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:57:32,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:57:32,676 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:57:32,676 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:57:32,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:57:32,677 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:57:32,677 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:57:32,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:57:32,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:57:32,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:57:32,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:57:32,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:57:32,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:57:32,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:57:32,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:57:32,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:57:32,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:57:32,680 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:57:32,680 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:57:32,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:57:32,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:57:32,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:57:32,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:57:32,682 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 -> b3751a2ceaae8972d788d7195cbb1b12ec209633513efd66a5d0e24c48ee8e17 [2024-11-12 04:57:33,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:57:33,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:57:33,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:57:33,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:57:33,067 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:57:33,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i [2024-11-12 04:57:34,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:57:34,901 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:57:34,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-22.i [2024-11-12 04:57:34,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210c3cf1b/d10260e678fc4479bb600aa801454db9/FLAGfbf1f5781 [2024-11-12 04:57:34,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/210c3cf1b/d10260e678fc4479bb600aa801454db9 [2024-11-12 04:57:34,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:57:34,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:57:34,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:57:34,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:57:34,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:57:34,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:57:34" (1/1) ... [2024-11-12 04:57:34,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470a36e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:34, skipping insertion in model container [2024-11-12 04:57:34,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:57:34" (1/1) ... [2024-11-12 04:57:34,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:57:35,190 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-1loop_file-22.i[916,929] [2024-11-12 04:57:35,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:57:35,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:57:35,320 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-1loop_file-22.i[916,929] [2024-11-12 04:57:35,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:57:35,391 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:57:35,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35 WrapperNode [2024-11-12 04:57:35,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:57:35,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:57:35,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:57:35,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:57:35,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,457 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-12 04:57:35,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:57:35,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:57:35,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:57:35,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:57:35,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,497 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 04:57:35,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:57:35,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:57:35,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:57:35,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:57:35,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (1/1) ... [2024-11-12 04:57:35,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:57:35,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:57:35,580 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 04:57:35,583 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 04:57:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:57:35,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:57:35,627 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:57:35,627 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:57:35,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:57:35,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:57:35,735 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:57:35,737 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:57:36,811 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-12 04:57:36,812 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:57:36,827 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:57:36,828 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:57:36,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:57:36 BoogieIcfgContainer [2024-11-12 04:57:36,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:57:36,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:57:36,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:57:36,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:57:36,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:57:34" (1/3) ... [2024-11-12 04:57:36,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f8d654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:57:36, skipping insertion in model container [2024-11-12 04:57:36,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:57:35" (2/3) ... [2024-11-12 04:57:36,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f8d654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:57:36, skipping insertion in model container [2024-11-12 04:57:36,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:57:36" (3/3) ... [2024-11-12 04:57:36,838 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-22.i [2024-11-12 04:57:36,854 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:57:36,854 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:57:36,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:57:36,947 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;@776a03e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:57:36,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:57:36,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 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 04:57:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-12 04:57:36,967 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:57:36,968 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 04:57:36,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:57:36,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:57:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash -476078151, now seen corresponding path program 1 times [2024-11-12 04:57:36,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:57:36,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254338048] [2024-11-12 04:57:36,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:57:36,986 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 04:57:36,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:57:36,990 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 04:57:36,992 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 04:57:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:37,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:57:37,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:57:37,339 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 04:57:37,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:57:37,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:57:37,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254338048] [2024-11-12 04:57:37,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254338048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:57:37,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:57:37,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:57:37,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384623283] [2024-11-12 04:57:37,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:57:37,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:57:37,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:57:37,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:57:37,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:57:37,384 INFO L87 Difference]: Start difference. First operand has 88 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 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 04:57:37,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:57:37,419 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2024-11-12 04:57:37,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:57:37,421 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 04:57:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:57:37,435 INFO L225 Difference]: With dead ends: 173 [2024-11-12 04:57:37,436 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 04:57:37,443 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 04:57:37,448 INFO L435 NwaCegarLoop]: 135 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, 135 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 04:57:37,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:57:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 04:57:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-12 04:57:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 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 04:57:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2024-11-12 04:57:37,514 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 193 [2024-11-12 04:57:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:57:37,516 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2024-11-12 04:57:37,516 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 04:57:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2024-11-12 04:57:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-12 04:57:37,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:57:37,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] [2024-11-12 04:57:37,533 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 04:57:37,723 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 04:57:37,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:57:37,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:57:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash 268295863, now seen corresponding path program 1 times [2024-11-12 04:57:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:57:37,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506555771] [2024-11-12 04:57:37,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:57:37,730 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 04:57:37,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:57:37,733 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 04:57:37,735 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 04:57:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:37,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 04:57:37,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:57:39,551 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 04:57:39,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:57:39,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:57:39,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506555771] [2024-11-12 04:57:39,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506555771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:57:39,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:57:39,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:57:39,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828563874] [2024-11-12 04:57:39,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:57:39,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:57:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:57:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:57:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:57:39,559 INFO L87 Difference]: Start difference. First operand 84 states and 131 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 04:57:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:57:40,915 INFO L93 Difference]: Finished difference Result 272 states and 427 transitions. [2024-11-12 04:57:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:57:40,928 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 04:57:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:57:40,932 INFO L225 Difference]: With dead ends: 272 [2024-11-12 04:57:40,933 INFO L226 Difference]: Without dead ends: 191 [2024-11-12 04:57:40,934 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 04:57:40,937 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 136 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 442 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.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:57:40,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 442 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 04:57:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-12 04:57:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 162. [2024-11-12 04:57:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 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 04:57:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 255 transitions. [2024-11-12 04:57:40,993 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 255 transitions. Word has length 193 [2024-11-12 04:57:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:57:40,994 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 255 transitions. [2024-11-12 04:57:40,995 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 04:57:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 255 transitions. [2024-11-12 04:57:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-12 04:57:41,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:57:41,001 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 04:57:41,011 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