/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:39:04,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:39:04,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 02:39:04,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:39:04,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:39:04,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:39:04,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:39:04,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:39:04,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:39:04,359 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:39:04,359 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:39:04,359 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:39:04,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:39:04,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:39:04,361 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:39:04,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:39:04,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:39:04,361 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:39:04,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:39:04,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:39:04,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:39:04,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:39:04,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:39:04,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:39:04,363 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:39:04,363 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:39:04,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:39:04,363 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:39:04,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:39:04,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:39:04,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:39:04,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:39:04,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:39:04,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:39:04,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:39:04,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:39:04,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:39:04,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:39:04,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:39:04,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:39:04,366 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:39:04,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:39:04,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:39:04,366 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: Use bitabs translation -> false [2023-12-21 02:39:04,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:39:04,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:39:04,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:39:04,563 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:39:04,563 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:39:04,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i [2023-12-21 02:39:05,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:39:05,691 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:39:05,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i [2023-12-21 02:39:05,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9754bd13/580790b5d8604b11867f580dfdee75b7/FLAGf2ad192af [2023-12-21 02:39:05,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9754bd13/580790b5d8604b11867f580dfdee75b7 [2023-12-21 02:39:05,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:39:05,723 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:39:05,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:39:05,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:39:05,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:39:05,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:05,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198beb15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05, skipping insertion in model container [2023-12-21 02:39:05,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:05,757 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:39:05,876 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i[917,930] [2023-12-21 02:39:05,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:39:05,916 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:39:05,923 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i[917,930] [2023-12-21 02:39:05,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:39:05,964 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:39:05,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05 WrapperNode [2023-12-21 02:39:05,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:39:05,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:39:05,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:39:05,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:39:05,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:05,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,023 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2023-12-21 02:39:06,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:39:06,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:39:06,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:39:06,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:39:06,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,070 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2023-12-21 02:39:06,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:39:06,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:39:06,102 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:39:06,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:39:06,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (1/1) ... [2023-12-21 02:39:06,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:39:06,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:39:06,140 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) [2023-12-21 02:39:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:39:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:39:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:39:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:39:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:39:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:39:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:39:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:39:06,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:39:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:39:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:39:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:39:06,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:39:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:39:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:39:06,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:39:06,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:39:06,164 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 [2023-12-21 02:39:06,276 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:39:06,278 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:39:06,605 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:39:06,628 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:39:06,628 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:39:06,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:39:06 BoogieIcfgContainer [2023-12-21 02:39:06,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:39:06,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:39:06,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:39:06,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:39:06,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:39:05" (1/3) ... [2023-12-21 02:39:06,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51970692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:39:06, skipping insertion in model container [2023-12-21 02:39:06,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:39:05" (2/3) ... [2023-12-21 02:39:06,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51970692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:39:06, skipping insertion in model container [2023-12-21 02:39:06,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:39:06" (3/3) ... [2023-12-21 02:39:06,634 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-42.i [2023-12-21 02:39:06,645 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:39:06,646 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:39:06,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:39:06,687 INFO L357 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, mHoare=true, 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;@5d64508c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:39:06,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:39:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 02:39:06,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:06,698 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:06,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:06,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:06,702 INFO L85 PathProgramCache]: Analyzing trace with hash -64383572, now seen corresponding path program 1 times [2023-12-21 02:39:06,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:06,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012102195] [2023-12-21 02:39:06,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:06,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:06,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:06,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:06,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:06,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:06,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:07,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:07,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012102195] [2023-12-21 02:39:07,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012102195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:39:07,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:39:07,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:39:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988751263] [2023-12-21 02:39:07,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:07,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:39:07,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:07,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:39:07,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:39:07,037 INFO L87 Difference]: Start difference. First operand has 93 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-21 02:39:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:07,085 INFO L93 Difference]: Finished difference Result 183 states and 283 transitions. [2023-12-21 02:39:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:39:07,087 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2023-12-21 02:39:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:07,109 INFO L225 Difference]: With dead ends: 183 [2023-12-21 02:39:07,109 INFO L226 Difference]: Without dead ends: 91 [2023-12-21 02:39:07,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:39:07,114 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:07,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:39:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-21 02:39:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-12-21 02:39:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2023-12-21 02:39:07,163 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 98 [2023-12-21 02:39:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:07,163 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2023-12-21 02:39:07,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-21 02:39:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2023-12-21 02:39:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 02:39:07,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:07,168 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:07,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:39:07,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:07,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1768429254, now seen corresponding path program 1 times [2023-12-21 02:39:07,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:07,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002108096] [2023-12-21 02:39:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:07,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002108096] [2023-12-21 02:39:07,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002108096] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:39:07,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:39:07,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:39:07,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498014902] [2023-12-21 02:39:07,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:07,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:39:07,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:07,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:39:07,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:39:07,379 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-21 02:39:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:07,439 INFO L93 Difference]: Finished difference Result 187 states and 268 transitions. [2023-12-21 02:39:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:39:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2023-12-21 02:39:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:07,445 INFO L225 Difference]: With dead ends: 187 [2023-12-21 02:39:07,445 INFO L226 Difference]: Without dead ends: 97 [2023-12-21 02:39:07,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:39:07,446 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 10 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:07,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 367 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:39:07,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-21 02:39:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2023-12-21 02:39:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2023-12-21 02:39:07,454 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 98 [2023-12-21 02:39:07,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:07,455 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2023-12-21 02:39:07,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-21 02:39:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2023-12-21 02:39:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 02:39:07,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:07,456 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:07,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:39:07,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:07,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:07,457 INFO L85 PathProgramCache]: Analyzing trace with hash 110701692, now seen corresponding path program 1 times [2023-12-21 02:39:07,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:07,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368715303] [2023-12-21 02:39:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:07,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:07,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368715303] [2023-12-21 02:39:07,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368715303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:39:07,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:39:07,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:39:07,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911290756] [2023-12-21 02:39:07,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:07,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:39:07,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:07,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:39:07,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:39:07,965 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:08,043 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2023-12-21 02:39:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:39:08,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2023-12-21 02:39:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:08,048 INFO L225 Difference]: With dead ends: 185 [2023-12-21 02:39:08,048 INFO L226 Difference]: Without dead ends: 93 [2023-12-21 02:39:08,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:39:08,054 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:08,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 319 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:39:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-21 02:39:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-21 02:39:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2023-12-21 02:39:08,064 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 98 [2023-12-21 02:39:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:08,064 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2023-12-21 02:39:08,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2023-12-21 02:39:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 02:39:08,065 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:08,065 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:08,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:39:08,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:08,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash -23311814, now seen corresponding path program 1 times [2023-12-21 02:39:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:08,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950416101] [2023-12-21 02:39:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:08,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:08,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:08,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950416101] [2023-12-21 02:39:08,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950416101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:39:08,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:39:08,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:39:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069274013] [2023-12-21 02:39:08,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:08,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:39:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:39:08,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:39:08,386 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:08,467 INFO L93 Difference]: Finished difference Result 212 states and 300 transitions. [2023-12-21 02:39:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:39:08,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2023-12-21 02:39:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:08,469 INFO L225 Difference]: With dead ends: 212 [2023-12-21 02:39:08,469 INFO L226 Difference]: Without dead ends: 120 [2023-12-21 02:39:08,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:39:08,475 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 123 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:08,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 262 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:39:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-21 02:39:08,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2023-12-21 02:39:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2023-12-21 02:39:08,490 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 98 [2023-12-21 02:39:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:08,491 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2023-12-21 02:39:08,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2023-12-21 02:39:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 02:39:08,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:08,494 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:08,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:39:08,495 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:08,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash -610117828, now seen corresponding path program 1 times [2023-12-21 02:39:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:08,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195594152] [2023-12-21 02:39:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:08,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:10,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:10,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195594152] [2023-12-21 02:39:10,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195594152] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:39:10,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:39:10,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 02:39:10,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737096895] [2023-12-21 02:39:10,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:10,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 02:39:10,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:10,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 02:39:10,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:39:10,417 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:10,939 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2023-12-21 02:39:10,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:39:10,940 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2023-12-21 02:39:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:10,941 INFO L225 Difference]: With dead ends: 211 [2023-12-21 02:39:10,941 INFO L226 Difference]: Without dead ends: 119 [2023-12-21 02:39:10,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2023-12-21 02:39:10,942 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 348 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:10,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 381 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:39:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-21 02:39:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 95. [2023-12-21 02:39:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2023-12-21 02:39:10,950 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 98 [2023-12-21 02:39:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:10,950 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2023-12-21 02:39:10,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2023-12-21 02:39:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 02:39:10,951 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:10,951 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:10,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:39:10,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:10,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1003144838, now seen corresponding path program 1 times [2023-12-21 02:39:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:10,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723006609] [2023-12-21 02:39:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:11,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:11,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:11,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:12,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:12,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:12,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:12,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:12,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-21 02:39:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:12,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723006609] [2023-12-21 02:39:12,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723006609] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:39:12,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380257591] [2023-12-21 02:39:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:12,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:39:12,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:39:12,082 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) [2023-12-21 02:39:12,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 02:39:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:12,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-21 02:39:12,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:39:13,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 02:39:13,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:13,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 02:39:13,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:13,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 02:39:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-21 02:39:13,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:39:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:13,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380257591] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:39:13,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 02:39:13,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 12] total 34 [2023-12-21 02:39:13,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852193591] [2023-12-21 02:39:13,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:13,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 02:39:13,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:13,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 02:39:13,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 02:39:13,871 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:14,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:14,585 INFO L93 Difference]: Finished difference Result 270 states and 376 transitions. [2023-12-21 02:39:14,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:39:14,587 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2023-12-21 02:39:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:14,588 INFO L225 Difference]: With dead ends: 270 [2023-12-21 02:39:14,588 INFO L226 Difference]: Without dead ends: 176 [2023-12-21 02:39:14,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 02:39:14,589 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 412 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:14,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 675 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 02:39:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-21 02:39:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 115. [2023-12-21 02:39:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2023-12-21 02:39:14,599 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 98 [2023-12-21 02:39:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:14,600 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2023-12-21 02:39:14,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2023-12-21 02:39:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 02:39:14,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:14,601 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:14,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 02:39:14,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-21 02:39:14,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:14,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1317604097, now seen corresponding path program 1 times [2023-12-21 02:39:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:14,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048686900] [2023-12-21 02:39:14,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:14,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:14,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048686900] [2023-12-21 02:39:14,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048686900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:39:14,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:39:14,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:39:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368496160] [2023-12-21 02:39:14,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:14,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:39:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:14,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:39:14,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:39:14,942 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:15,036 INFO L93 Difference]: Finished difference Result 258 states and 360 transitions. [2023-12-21 02:39:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:39:15,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2023-12-21 02:39:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:15,037 INFO L225 Difference]: With dead ends: 258 [2023-12-21 02:39:15,038 INFO L226 Difference]: Without dead ends: 144 [2023-12-21 02:39:15,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:39:15,038 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 115 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:15,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 268 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:39:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-21 02:39:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 115. [2023-12-21 02:39:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2023-12-21 02:39:15,047 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 98 [2023-12-21 02:39:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:15,047 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2023-12-21 02:39:15,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2023-12-21 02:39:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 02:39:15,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:15,048 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:15,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 02:39:15,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:15,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash 730798083, now seen corresponding path program 1 times [2023-12-21 02:39:15,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:15,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733043582] [2023-12-21 02:39:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:15,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:15,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:15,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733043582] [2023-12-21 02:39:15,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733043582] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:39:15,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:39:15,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:39:15,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810421454] [2023-12-21 02:39:15,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:15,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:39:15,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:39:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:39:15,152 INFO L87 Difference]: Start difference. First operand 115 states and 159 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:15,169 INFO L93 Difference]: Finished difference Result 227 states and 315 transitions. [2023-12-21 02:39:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:39:15,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2023-12-21 02:39:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:15,171 INFO L225 Difference]: With dead ends: 227 [2023-12-21 02:39:15,171 INFO L226 Difference]: Without dead ends: 113 [2023-12-21 02:39:15,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:39:15,173 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 41 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:15,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 197 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:39:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-21 02:39:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-21 02:39:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.33) internal successors, (133), 100 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2023-12-21 02:39:15,182 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 155 transitions. Word has length 98 [2023-12-21 02:39:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:15,182 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 155 transitions. [2023-12-21 02:39:15,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2023-12-21 02:39:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 02:39:15,183 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:15,183 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:15,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 02:39:15,183 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:15,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1364001389, now seen corresponding path program 1 times [2023-12-21 02:39:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:15,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463447849] [2023-12-21 02:39:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:15,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:15,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463447849] [2023-12-21 02:39:15,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463447849] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:39:15,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:39:15,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:39:15,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151528859] [2023-12-21 02:39:15,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:15,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:39:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:39:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:39:15,309 INFO L87 Difference]: Start difference. First operand 113 states and 155 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:15,359 INFO L93 Difference]: Finished difference Result 225 states and 309 transitions. [2023-12-21 02:39:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 02:39:15,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2023-12-21 02:39:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:15,360 INFO L225 Difference]: With dead ends: 225 [2023-12-21 02:39:15,360 INFO L226 Difference]: Without dead ends: 113 [2023-12-21 02:39:15,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:39:15,360 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:15,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:39:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-21 02:39:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-21 02:39:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2023-12-21 02:39:15,367 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 98 [2023-12-21 02:39:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:15,367 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2023-12-21 02:39:15,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2023-12-21 02:39:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-21 02:39:15,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:15,368 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:15,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 02:39:15,368 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:15,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1498014895, now seen corresponding path program 1 times [2023-12-21 02:39:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:15,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853642272] [2023-12-21 02:39:15,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:15,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:15,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:15,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853642272] [2023-12-21 02:39:15,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853642272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:39:15,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:39:15,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:39:15,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980686511] [2023-12-21 02:39:15,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:15,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:39:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:15,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:39:15,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:39:15,459 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:15,473 INFO L93 Difference]: Finished difference Result 201 states and 274 transitions. [2023-12-21 02:39:15,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:39:15,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2023-12-21 02:39:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:15,474 INFO L225 Difference]: With dead ends: 201 [2023-12-21 02:39:15,474 INFO L226 Difference]: Without dead ends: 89 [2023-12-21 02:39:15,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:39:15,475 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:15,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:39:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-21 02:39:15,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-21 02:39:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 76 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 02:39:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2023-12-21 02:39:15,482 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 98 [2023-12-21 02:39:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:15,482 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2023-12-21 02:39:15,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-21 02:39:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2023-12-21 02:39:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-21 02:39:15,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:15,483 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:15,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 02:39:15,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:15,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:15,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2023181535, now seen corresponding path program 1 times [2023-12-21 02:39:15,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:15,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409236208] [2023-12-21 02:39:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:15,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-21 02:39:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409236208] [2023-12-21 02:39:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409236208] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:39:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130454055] [2023-12-21 02:39:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:16,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:39:16,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:39:16,588 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) [2023-12-21 02:39:16,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 02:39:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:16,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-21 02:39:16,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:39:17,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 02:39:17,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 02:39:18,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-21 02:39:18,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-21 02:39:18,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:18,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:18,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:18,907 INFO L349 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2023-12-21 02:39:18,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 63 [2023-12-21 02:39:19,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,046 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 02:39:19,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2023-12-21 02:39:19,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-12-21 02:39:19,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:39:19,228 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 02:39:19,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2023-12-21 02:39:19,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2023-12-21 02:39:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 118 proven. 61 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-21 02:39:19,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:39:39,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130454055] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:39:39,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 02:39:39,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 32 [2023-12-21 02:39:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026334097] [2023-12-21 02:39:39,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 02:39:39,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 02:39:39,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:39,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 02:39:39,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1046, Unknown=4, NotChecked=0, Total=1332 [2023-12-21 02:39:39,736 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 32 states, 28 states have (on average 3.392857142857143) internal successors, (95), 30 states have internal predecessors, (95), 11 states have call successors, (22), 5 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) [2023-12-21 02:39:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:41,509 INFO L93 Difference]: Finished difference Result 221 states and 291 transitions. [2023-12-21 02:39:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 02:39:41,511 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 3.392857142857143) internal successors, (95), 30 states have internal predecessors, (95), 11 states have call successors, (22), 5 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) Word has length 100 [2023-12-21 02:39:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:41,512 INFO L225 Difference]: With dead ends: 221 [2023-12-21 02:39:41,512 INFO L226 Difference]: Without dead ends: 133 [2023-12-21 02:39:41,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=673, Invalid=2079, Unknown=4, NotChecked=0, Total=2756 [2023-12-21 02:39:41,514 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 312 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 87 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:41,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 626 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1080 Invalid, 1 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 02:39:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-21 02:39:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2023-12-21 02:39:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 96 states have internal predecessors, (119), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:39:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2023-12-21 02:39:41,526 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 100 [2023-12-21 02:39:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:41,527 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2023-12-21 02:39:41,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 3.392857142857143) internal successors, (95), 30 states have internal predecessors, (95), 11 states have call successors, (22), 5 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) [2023-12-21 02:39:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2023-12-21 02:39:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-21 02:39:41,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:41,528 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:41,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-21 02:39:41,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-21 02:39:41,734 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:41,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1438086298, now seen corresponding path program 1 times [2023-12-21 02:39:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:41,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025100290] [2023-12-21 02:39:41,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:41,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:41,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:39:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:39:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 02:39:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 02:39:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 02:39:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 02:39:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 02:39:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 02:39:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:39:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 02:39:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 02:39:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:39:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-21 02:39:42,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:39:42,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025100290] [2023-12-21 02:39:42,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025100290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:39:42,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:39:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:39:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246451033] [2023-12-21 02:39:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:39:42,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:39:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:39:42,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:39:42,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:39:42,020 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-21 02:39:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:39:42,238 INFO L93 Difference]: Finished difference Result 210 states and 271 transitions. [2023-12-21 02:39:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:39:42,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2023-12-21 02:39:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:39:42,240 INFO L225 Difference]: With dead ends: 210 [2023-12-21 02:39:42,240 INFO L226 Difference]: Without dead ends: 114 [2023-12-21 02:39:42,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:39:42,241 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 188 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:39:42,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 299 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:39:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-21 02:39:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-12-21 02:39:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 96 states have internal predecessors, (118), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 02:39:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 146 transitions. [2023-12-21 02:39:42,252 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 146 transitions. Word has length 100 [2023-12-21 02:39:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:39:42,253 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 146 transitions. [2023-12-21 02:39:42,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-21 02:39:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2023-12-21 02:39:42,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-21 02:39:42,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:39:42,253 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:42,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:39:42,253 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:39:42,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:39:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1167937256, now seen corresponding path program 1 times [2023-12-21 02:39:42,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:39:42,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371141614] [2023-12-21 02:39:42,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:39:42,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:39:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:39:42,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:39:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:39:42,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:39:42,475 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:39:42,476 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:39:42,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:39:42,479 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:39:42,481 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:39:42,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:39:42 BoogieIcfgContainer [2023-12-21 02:39:42,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:39:42,603 INFO L158 Benchmark]: Toolchain (without parser) took 36880.46ms. Allocated memory was 329.3MB in the beginning and 728.8MB in the end (delta: 399.5MB). Free memory was 280.4MB in the beginning and 683.0MB in the end (delta: -402.7MB). Peak memory consumption was 428.8MB. Max. memory is 8.0GB. [2023-12-21 02:39:42,603 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 212.9MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:39:42,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.28ms. Allocated memory is still 329.3MB. Free memory was 280.4MB in the beginning and 265.1MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 02:39:42,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.39ms. Allocated memory is still 329.3MB. Free memory was 265.1MB in the beginning and 261.5MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 02:39:42,604 INFO L158 Benchmark]: Boogie Preprocessor took 77.37ms. Allocated memory is still 329.3MB. Free memory was 261.5MB in the beginning and 256.8MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 02:39:42,604 INFO L158 Benchmark]: RCFGBuilder took 526.52ms. Allocated memory is still 329.3MB. Free memory was 256.8MB in the beginning and 224.8MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-21 02:39:42,604 INFO L158 Benchmark]: TraceAbstraction took 35972.66ms. Allocated memory was 329.3MB in the beginning and 728.8MB in the end (delta: 399.5MB). Free memory was 224.3MB in the beginning and 683.0MB in the end (delta: -458.8MB). Peak memory consumption was 372.2MB. Max. memory is 8.0GB. [2023-12-21 02:39:42,607 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.44ms. Allocated memory is still 212.9MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.28ms. Allocated memory is still 329.3MB. Free memory was 280.4MB in the beginning and 265.1MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.39ms. Allocated memory is still 329.3MB. Free memory was 265.1MB in the beginning and 261.5MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.37ms. Allocated memory is still 329.3MB. Free memory was 261.5MB in the beginning and 256.8MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 526.52ms. Allocated memory is still 329.3MB. Free memory was 256.8MB in the beginning and 224.8MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 35972.66ms. Allocated memory was 329.3MB in the beginning and 728.8MB in the end (delta: 399.5MB). Free memory was 224.3MB in the beginning and 683.0MB in the end (delta: -458.8MB). Peak memory consumption was 372.2MB. Max. memory is 8.0GB. * 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 109. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L49] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L50] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L51] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L52] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L53] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L54] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L55] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L56] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L57] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L58] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L59] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L88] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L91] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_11 [L92] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_11 [L92] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L93] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L96] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L99] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L102] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, cond=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L117] RET updateVariables() [L118] CALL step() [L63] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L63] (*(WrapperStruct00_var_1_8_Pointer)) = ((*(WrapperStruct00_var_1_9_Pointer)) + 100) [L64] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L64] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) [L64] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L64] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L64] (*(WrapperStruct00_var_1_10_Pointer)) = (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))) [L65] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L65] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L65] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L68] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L68] (*(WrapperStruct00_var_1_1_Pointer)) = ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))))) [L70] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L70] COND TRUE (*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L71] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer)) [L72] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L72] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L81] COND FALSE !((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L84] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L84] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L84] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L84] (*(WrapperStruct00_var_1_12_Pointer)) = (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))) [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))))))) [L109] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100))) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L109] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))))) [L109] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) [L109] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L109] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))) && (((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : 1) : (((*(WrapperStruct00_var_1_8_Pointer)) <= 1000000) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))) && (((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : 1) : (((*(WrapperStruct00_var_1_8_Pointer)) <= 1000000) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109-L110] return ((((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))) && (((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : 1) : (((*(WrapperStruct00_var_1_8_Pointer)) <= 1000000) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)))) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.8s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1554 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1551 mSDsluCounter, 4050 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2760 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2499 IncrementalHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 1290 mSDtfsCounter, 2499 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 715 GetRequests, 583 SyntacticMatches, 3 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 23.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=6, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 164 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 1478 NumberOfCodeBlocks, 1478 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1461 ConstructedInterpolants, 13 QuantifiedInterpolants, 13935 SizeOfPredicates, 48 NumberOfNonLiveVariables, 819 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 3173/3300 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 [2023-12-21 02:39:42,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...