./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:05:04,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:05:04,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:05:04,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:05:04,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:05:04,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:05:04,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:05:04,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:05:04,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:05:04,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:05:04,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:05:04,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:05:04,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:05:04,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:05:04,789 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:05:04,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:05:04,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:05:04,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:05:04,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:05:04,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:05:04,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:05:04,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:05:04,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:05:04,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:05:04,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:05:04,795 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:05:04,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:05:04,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:05:04,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:05:04,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:05:04,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:05:04,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:05:04,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:05:04,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:05:04,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:05:04,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:05:04,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:05:04,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:05:04,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:05:04,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:05:04,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:05:04,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:05:04,798 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 [2024-11-20 09:05:05,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:05:05,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:05:05,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:05:05,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:05:05,069 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:05:05,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-11-20 09:05:06,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:05:06,661 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:05:06,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-11-20 09:05:06,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af36c8e94/0693600b902f418e96d97b3d70ab00a3/FLAGa266e03da [2024-11-20 09:05:06,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af36c8e94/0693600b902f418e96d97b3d70ab00a3 [2024-11-20 09:05:06,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:05:06,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:05:06,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:05:06,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:05:06,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:05:06,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:05:06" (1/1) ... [2024-11-20 09:05:06,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1920bd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:06, skipping insertion in model container [2024-11-20 09:05:06,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:05:06" (1/1) ... [2024-11-20 09:05:06,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:05:06,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i[917,930] [2024-11-20 09:05:07,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:05:07,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:05:07,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i[917,930] [2024-11-20 09:05:07,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:05:07,245 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:05:07,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07 WrapperNode [2024-11-20 09:05:07,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:05:07,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:05:07,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:05:07,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:05:07,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,424 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2024-11-20 09:05:07,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:05:07,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:05:07,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:05:07,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:05:07,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,448 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 09:05:07,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:05:07,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:05:07,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:05:07,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:05:07,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (1/1) ... [2024-11-20 09:05:07,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:05:07,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:05:07,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 09:05:07,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 09:05:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:05:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 09:05:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 09:05:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 09:05:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 09:05:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 09:05:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 09:05:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:05:07,578 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:05:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 09:05:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:05:07,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:05:07,671 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:05:07,673 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:05:08,318 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-20 09:05:08,319 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:05:08,336 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:05:08,336 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:05:08,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:05:08 BoogieIcfgContainer [2024-11-20 09:05:08,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:05:08,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:05:08,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:05:08,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:05:08,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:05:06" (1/3) ... [2024-11-20 09:05:08,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb1eee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:05:08, skipping insertion in model container [2024-11-20 09:05:08,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:05:07" (2/3) ... [2024-11-20 09:05:08,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb1eee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:05:08, skipping insertion in model container [2024-11-20 09:05:08,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:05:08" (3/3) ... [2024-11-20 09:05:08,346 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-23.i [2024-11-20 09:05:08,360 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:05:08,361 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:05:08,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:05:08,415 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f19b3b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:05:08,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:05:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-20 09:05:08,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:08,433 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:08,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:08,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1279411170, now seen corresponding path program 1 times [2024-11-20 09:05:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:08,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690880687] [2024-11-20 09:05:08,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:08,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:08,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:08,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690880687] [2024-11-20 09:05:08,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690880687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:08,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:08,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:05:08,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501666486] [2024-11-20 09:05:08,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:08,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:05:08,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:09,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:05:09,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:05:09,018 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 09:05:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:09,049 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2024-11-20 09:05:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:05:09,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-20 09:05:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:09,057 INFO L225 Difference]: With dead ends: 241 [2024-11-20 09:05:09,059 INFO L226 Difference]: Without dead ends: 120 [2024-11-20 09:05:09,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:05:09,064 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:09,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:05:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-20 09:05:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-20 09:05:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2024-11-20 09:05:09,103 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2024-11-20 09:05:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:09,104 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2024-11-20 09:05:09,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 09:05:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2024-11-20 09:05:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-20 09:05:09,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:09,110 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:09,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:05:09,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1334114070, now seen corresponding path program 1 times [2024-11-20 09:05:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:09,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058181995] [2024-11-20 09:05:09,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:09,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:09,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:09,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058181995] [2024-11-20 09:05:09,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058181995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:09,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:09,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:05:09,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898080496] [2024-11-20 09:05:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:09,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:05:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:09,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:05:09,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:05:09,516 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 09:05:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:09,598 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-11-20 09:05:09,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:05:09,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2024-11-20 09:05:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:09,601 INFO L225 Difference]: With dead ends: 239 [2024-11-20 09:05:09,601 INFO L226 Difference]: Without dead ends: 122 [2024-11-20 09:05:09,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:05:09,603 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:09,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:05:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-20 09:05:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-20 09:05:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2024-11-20 09:05:09,614 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 165 [2024-11-20 09:05:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:09,615 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2024-11-20 09:05:09,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 09:05:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2024-11-20 09:05:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-20 09:05:09,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:09,618 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:09,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:05:09,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:09,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash 699279976, now seen corresponding path program 1 times [2024-11-20 09:05:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:09,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329457138] [2024-11-20 09:05:09,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:09,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:14,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:14,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329457138] [2024-11-20 09:05:14,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329457138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:14,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:14,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-20 09:05:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845223910] [2024-11-20 09:05:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:14,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 09:05:14,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:14,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 09:05:14,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:05:14,938 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-20 09:05:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:16,987 INFO L93 Difference]: Finished difference Result 332 states and 484 transitions. [2024-11-20 09:05:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 09:05:16,988 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) Word has length 165 [2024-11-20 09:05:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:16,991 INFO L225 Difference]: With dead ends: 332 [2024-11-20 09:05:16,993 INFO L226 Difference]: Without dead ends: 213 [2024-11-20 09:05:16,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2024-11-20 09:05:16,995 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1104 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:16,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 741 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 09:05:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-20 09:05:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 137. [2024-11-20 09:05:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.4) internal successors, (161), 115 states have internal predecessors, (161), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2024-11-20 09:05:17,021 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 201 transitions. Word has length 165 [2024-11-20 09:05:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:17,022 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 201 transitions. [2024-11-20 09:05:17,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.25) internal successors, (68), 17 states have internal predecessors, (68), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-20 09:05:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2024-11-20 09:05:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-20 09:05:17,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:17,028 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:17,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:05:17,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:17,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash 112473962, now seen corresponding path program 1 times [2024-11-20 09:05:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278616867] [2024-11-20 09:05:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:21,357 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:21,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:21,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278616867] [2024-11-20 09:05:21,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278616867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:21,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:21,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 09:05:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341019107] [2024-11-20 09:05:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:21,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 09:05:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:21,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 09:05:21,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:05:21,362 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 09:05:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:23,100 INFO L93 Difference]: Finished difference Result 342 states and 500 transitions. [2024-11-20 09:05:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 09:05:23,100 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 165 [2024-11-20 09:05:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:23,102 INFO L225 Difference]: With dead ends: 342 [2024-11-20 09:05:23,102 INFO L226 Difference]: Without dead ends: 208 [2024-11-20 09:05:23,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:05:23,103 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 537 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:23,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 809 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 09:05:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-20 09:05:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 146. [2024-11-20 09:05:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.403225806451613) internal successors, (174), 124 states have internal predecessors, (174), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 214 transitions. [2024-11-20 09:05:23,117 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 214 transitions. Word has length 165 [2024-11-20 09:05:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:23,117 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 214 transitions. [2024-11-20 09:05:23,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 09:05:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 214 transitions. [2024-11-20 09:05:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-20 09:05:23,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:23,119 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:05:23,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:23,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:23,120 INFO L85 PathProgramCache]: Analyzing trace with hash -118368474, now seen corresponding path program 1 times [2024-11-20 09:05:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:23,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143685357] [2024-11-20 09:05:23,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:25,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143685357] [2024-11-20 09:05:25,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143685357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:25,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:25,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 09:05:25,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621549447] [2024-11-20 09:05:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:25,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 09:05:25,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:25,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 09:05:25,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:05:25,459 INFO L87 Difference]: Start difference. First operand 146 states and 214 transitions. Second operand has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:05:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:27,071 INFO L93 Difference]: Finished difference Result 322 states and 471 transitions. [2024-11-20 09:05:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:05:27,072 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-20 09:05:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:27,073 INFO L225 Difference]: With dead ends: 322 [2024-11-20 09:05:27,073 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 09:05:27,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:05:27,074 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 261 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:27,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 872 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 09:05:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 09:05:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 137. [2024-11-20 09:05:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.391304347826087) internal successors, (160), 115 states have internal predecessors, (160), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2024-11-20 09:05:27,091 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 165 [2024-11-20 09:05:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:27,091 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2024-11-20 09:05:27,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:05:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2024-11-20 09:05:27,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-20 09:05:27,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:27,093 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:27,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:05:27,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:27,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash 565266470, now seen corresponding path program 1 times [2024-11-20 09:05:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:27,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875274655] [2024-11-20 09:05:27,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:27,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:29,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875274655] [2024-11-20 09:05:29,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875274655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:29,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:29,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 09:05:29,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814085304] [2024-11-20 09:05:29,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:29,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:05:29,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:29,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:05:29,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:05:29,510 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:05:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:30,506 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2024-11-20 09:05:30,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:05:30,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-20 09:05:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:30,509 INFO L225 Difference]: With dead ends: 315 [2024-11-20 09:05:30,510 INFO L226 Difference]: Without dead ends: 181 [2024-11-20 09:05:30,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-20 09:05:30,512 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 321 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:30,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 460 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 09:05:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-20 09:05:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2024-11-20 09:05:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2024-11-20 09:05:30,525 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 165 [2024-11-20 09:05:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:30,526 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2024-11-20 09:05:30,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:05:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2024-11-20 09:05:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-20 09:05:30,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:30,527 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:30,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:05:30,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:30,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash -21539544, now seen corresponding path program 1 times [2024-11-20 09:05:30,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:30,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955540849] [2024-11-20 09:05:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:32,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955540849] [2024-11-20 09:05:32,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955540849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:32,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:32,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:05:32,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395787882] [2024-11-20 09:05:32,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:32,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:05:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:32,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:05:32,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:05:32,412 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:05:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:33,764 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2024-11-20 09:05:33,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:05:33,765 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2024-11-20 09:05:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:33,766 INFO L225 Difference]: With dead ends: 326 [2024-11-20 09:05:33,766 INFO L226 Difference]: Without dead ends: 181 [2024-11-20 09:05:33,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-20 09:05:33,768 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 177 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:33,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 935 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 09:05:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-20 09:05:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2024-11-20 09:05:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2024-11-20 09:05:33,778 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 165 [2024-11-20 09:05:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:33,778 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2024-11-20 09:05:33,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:05:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2024-11-20 09:05:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 09:05:33,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:33,779 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:33,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:05:33,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:33,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash -575774022, now seen corresponding path program 1 times [2024-11-20 09:05:33,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:33,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883575627] [2024-11-20 09:05:33,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:33,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:33,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:33,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883575627] [2024-11-20 09:05:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883575627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:33,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:33,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:05:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398096379] [2024-11-20 09:05:33,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:33,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:05:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:05:33,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:05:33,988 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:05:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:34,024 INFO L93 Difference]: Finished difference Result 296 states and 435 transitions. [2024-11-20 09:05:34,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:05:34,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2024-11-20 09:05:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:34,026 INFO L225 Difference]: With dead ends: 296 [2024-11-20 09:05:34,026 INFO L226 Difference]: Without dead ends: 151 [2024-11-20 09:05:34,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:05:34,027 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:34,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:05:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-20 09:05:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-20 09:05:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 129 states have internal predecessors, (180), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2024-11-20 09:05:34,041 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 167 [2024-11-20 09:05:34,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:34,041 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2024-11-20 09:05:34,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:05:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2024-11-20 09:05:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 09:05:34,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:34,043 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:34,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:05:34,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:34,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1938987293, now seen corresponding path program 1 times [2024-11-20 09:05:34,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:34,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853524726] [2024-11-20 09:05:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:34,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:36,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:36,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853524726] [2024-11-20 09:05:36,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853524726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:36,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:36,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:05:36,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893551776] [2024-11-20 09:05:36,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:36,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:05:36,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:36,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:05:36,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:05:36,452 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:05:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:37,647 INFO L93 Difference]: Finished difference Result 341 states and 494 transitions. [2024-11-20 09:05:37,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:05:37,649 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-20 09:05:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:37,650 INFO L225 Difference]: With dead ends: 341 [2024-11-20 09:05:37,651 INFO L226 Difference]: Without dead ends: 193 [2024-11-20 09:05:37,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-20 09:05:37,651 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 457 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:37,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 646 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 09:05:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-20 09:05:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 153. [2024-11-20 09:05:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 131 states have internal predecessors, (183), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2024-11-20 09:05:37,677 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 167 [2024-11-20 09:05:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:37,677 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2024-11-20 09:05:37,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:05:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2024-11-20 09:05:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 09:05:37,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:37,682 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:37,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:05:37,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:37,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:37,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1352181279, now seen corresponding path program 1 times [2024-11-20 09:05:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:37,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093971510] [2024-11-20 09:05:37,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093971510] [2024-11-20 09:05:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093971510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:40,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:40,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 09:05:40,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925224265] [2024-11-20 09:05:40,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:40,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 09:05:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:40,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 09:05:40,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:05:40,836 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:05:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:42,842 INFO L93 Difference]: Finished difference Result 384 states and 553 transitions. [2024-11-20 09:05:42,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:05:42,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-20 09:05:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:42,844 INFO L225 Difference]: With dead ends: 384 [2024-11-20 09:05:42,844 INFO L226 Difference]: Without dead ends: 234 [2024-11-20 09:05:42,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:05:42,845 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 492 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:42,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 816 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 09:05:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-20 09:05:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 151. [2024-11-20 09:05:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 129 states have internal predecessors, (180), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2024-11-20 09:05:42,864 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 167 [2024-11-20 09:05:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:42,864 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2024-11-20 09:05:42,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:05:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2024-11-20 09:05:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 09:05:42,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:42,866 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:42,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:05:42,866 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:42,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1389290381, now seen corresponding path program 1 times [2024-11-20 09:05:42,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:42,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245246544] [2024-11-20 09:05:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:42,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:44,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:44,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245246544] [2024-11-20 09:05:44,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245246544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:44,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:44,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 09:05:44,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471195607] [2024-11-20 09:05:44,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:44,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 09:05:44,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:44,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 09:05:44,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:05:44,476 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:05:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:45,794 INFO L93 Difference]: Finished difference Result 352 states and 511 transitions. [2024-11-20 09:05:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 09:05:45,795 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2024-11-20 09:05:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:45,796 INFO L225 Difference]: With dead ends: 352 [2024-11-20 09:05:45,796 INFO L226 Difference]: Without dead ends: 204 [2024-11-20 09:05:45,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:05:45,797 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 298 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:45,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 947 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 09:05:45,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-20 09:05:45,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 164. [2024-11-20 09:05:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 241 transitions. [2024-11-20 09:05:45,809 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 241 transitions. Word has length 167 [2024-11-20 09:05:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:45,809 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 241 transitions. [2024-11-20 09:05:45,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:05:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2024-11-20 09:05:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 09:05:45,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:45,811 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:45,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:05:45,811 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:45,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:45,811 INFO L85 PathProgramCache]: Analyzing trace with hash 802484367, now seen corresponding path program 1 times [2024-11-20 09:05:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:45,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097258550] [2024-11-20 09:05:45,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:49,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:49,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097258550] [2024-11-20 09:05:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097258550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 09:05:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175912936] [2024-11-20 09:05:49,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:49,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 09:05:49,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:49,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 09:05:49,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:05:49,354 INFO L87 Difference]: Start difference. First operand 164 states and 241 transitions. Second operand has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 09:05:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:50,735 INFO L93 Difference]: Finished difference Result 361 states and 526 transitions. [2024-11-20 09:05:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:05:50,736 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 167 [2024-11-20 09:05:50,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:50,737 INFO L225 Difference]: With dead ends: 361 [2024-11-20 09:05:50,742 INFO L226 Difference]: Without dead ends: 200 [2024-11-20 09:05:50,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-11-20 09:05:50,743 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 329 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:50,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 643 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 09:05:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-20 09:05:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 162. [2024-11-20 09:05:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2024-11-20 09:05:50,771 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 167 [2024-11-20 09:05:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:50,771 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2024-11-20 09:05:50,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 09:05:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2024-11-20 09:05:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 09:05:50,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:50,773 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:50,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:05:50,773 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:50,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2001026907, now seen corresponding path program 1 times [2024-11-20 09:05:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:50,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180528015] [2024-11-20 09:05:50,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:54,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:55,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:55,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:55,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:55,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:55,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:55,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:55,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:55,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:55,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180528015] [2024-11-20 09:05:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180528015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:55,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 09:05:55,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217032844] [2024-11-20 09:05:55,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:55,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 09:05:55,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:55,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 09:05:55,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-20 09:05:55,212 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 15 states have internal predecessors, (70), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-20 09:05:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:05:56,636 INFO L93 Difference]: Finished difference Result 359 states and 524 transitions. [2024-11-20 09:05:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:05:56,636 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 15 states have internal predecessors, (70), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 6 states have call successors, (20) Word has length 167 [2024-11-20 09:05:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:05:56,638 INFO L225 Difference]: With dead ends: 359 [2024-11-20 09:05:56,638 INFO L226 Difference]: Without dead ends: 200 [2024-11-20 09:05:56,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-11-20 09:05:56,639 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 589 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:05:56,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 512 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 09:05:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-20 09:05:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 164. [2024-11-20 09:05:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.408450704225352) internal successors, (200), 142 states have internal predecessors, (200), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:05:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 240 transitions. [2024-11-20 09:05:56,667 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 240 transitions. Word has length 167 [2024-11-20 09:05:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:05:56,667 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 240 transitions. [2024-11-20 09:05:56,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 15 states have internal predecessors, (70), 6 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 4 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-20 09:05:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 240 transitions. [2024-11-20 09:05:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 09:05:56,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:05:56,669 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:05:56,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 09:05:56,669 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:05:56,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:05:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1414220893, now seen corresponding path program 1 times [2024-11-20 09:05:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:05:56,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172160094] [2024-11-20 09:05:56,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:05:56,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:05:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:05:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:05:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:05:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:05:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:05:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:05:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:05:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:05:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:05:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:05:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:05:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:05:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:05:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:05:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:05:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:05:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:05:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:58,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:05:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:59,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:05:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:59,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:05:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:05:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:05:59,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:05:59,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172160094] [2024-11-20 09:05:59,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172160094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:05:59,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:05:59,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:05:59,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158423292] [2024-11-20 09:05:59,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:05:59,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:05:59,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:05:59,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:05:59,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:05:59,013 INFO L87 Difference]: Start difference. First operand 164 states and 240 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:06:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:00,323 INFO L93 Difference]: Finished difference Result 361 states and 525 transitions. [2024-11-20 09:06:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:06:00,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-20 09:06:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:00,325 INFO L225 Difference]: With dead ends: 361 [2024-11-20 09:06:00,325 INFO L226 Difference]: Without dead ends: 200 [2024-11-20 09:06:00,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-20 09:06:00,326 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 228 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:00,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 929 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 09:06:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-20 09:06:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 162. [2024-11-20 09:06:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:06:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2024-11-20 09:06:00,338 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 167 [2024-11-20 09:06:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:00,339 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2024-11-20 09:06:00,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:06:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2024-11-20 09:06:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 09:06:00,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:00,340 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:06:00,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 09:06:00,340 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:00,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:00,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1451329995, now seen corresponding path program 1 times [2024-11-20 09:06:00,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:00,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424381950] [2024-11-20 09:06:00,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:00,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:06:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:06:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:06:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:06:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:06:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:06:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:06:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:06:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:06:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:06:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:06:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:06:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:06:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:06:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:06:01,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:01,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424381950] [2024-11-20 09:06:01,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424381950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:01,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:01,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 09:06:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256666217] [2024-11-20 09:06:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:01,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 09:06:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:01,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 09:06:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:06:01,451 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:06:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:02,117 INFO L93 Difference]: Finished difference Result 321 states and 473 transitions. [2024-11-20 09:06:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:06:02,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-20 09:06:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:02,118 INFO L225 Difference]: With dead ends: 321 [2024-11-20 09:06:02,118 INFO L226 Difference]: Without dead ends: 162 [2024-11-20 09:06:02,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:06:02,119 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 132 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:02,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 446 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 09:06:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-20 09:06:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-20 09:06:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 140 states have internal predecessors, (197), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:06:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2024-11-20 09:06:02,131 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 237 transitions. Word has length 167 [2024-11-20 09:06:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:02,131 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 237 transitions. [2024-11-20 09:06:02,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:06:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2024-11-20 09:06:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 09:06:02,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:02,133 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:06:02,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 09:06:02,133 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:02,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash -354108339, now seen corresponding path program 1 times [2024-11-20 09:06:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:02,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074038826] [2024-11-20 09:06:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:02,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:06:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:06:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:06:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:06:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:06:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:06:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:06:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:06:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:06:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:06:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:06:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:06:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:06:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:06:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:06:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074038826] [2024-11-20 09:06:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074038826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:06,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:06:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056512690] [2024-11-20 09:06:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:06,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:06:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:06,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:06:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:06:06,397 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. Second operand has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 13 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 09:06:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:07,789 INFO L93 Difference]: Finished difference Result 361 states and 524 transitions. [2024-11-20 09:06:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 09:06:07,790 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 13 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 167 [2024-11-20 09:06:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:07,791 INFO L225 Difference]: With dead ends: 361 [2024-11-20 09:06:07,791 INFO L226 Difference]: Without dead ends: 202 [2024-11-20 09:06:07,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-20 09:06:07,792 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 497 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:07,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 607 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 09:06:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-20 09:06:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 164. [2024-11-20 09:06:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.4014084507042253) internal successors, (199), 142 states have internal predecessors, (199), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:06:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 239 transitions. [2024-11-20 09:06:07,804 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 239 transitions. Word has length 167 [2024-11-20 09:06:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:07,805 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 239 transitions. [2024-11-20 09:06:07,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 13 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-20 09:06:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 239 transitions. [2024-11-20 09:06:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-20 09:06:07,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:07,806 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:06:07,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 09:06:07,806 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:07,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:07,807 INFO L85 PathProgramCache]: Analyzing trace with hash -940914353, now seen corresponding path program 1 times [2024-11-20 09:06:07,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:07,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011067904] [2024-11-20 09:06:07,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:07,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:06:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:06:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:06:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:06:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:06:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:06:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:06:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:06:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:06:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:06:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:06:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:06:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:06:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:06:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:06:09,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011067904] [2024-11-20 09:06:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011067904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:09,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:09,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:06:09,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037450768] [2024-11-20 09:06:09,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:09,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:06:09,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:09,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:06:09,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:06:09,905 INFO L87 Difference]: Start difference. First operand 164 states and 239 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:06:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:11,316 INFO L93 Difference]: Finished difference Result 363 states and 525 transitions. [2024-11-20 09:06:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:06:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2024-11-20 09:06:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:11,317 INFO L225 Difference]: With dead ends: 363 [2024-11-20 09:06:11,317 INFO L226 Difference]: Without dead ends: 202 [2024-11-20 09:06:11,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-11-20 09:06:11,318 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 177 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:11,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 999 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 09:06:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-20 09:06:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2024-11-20 09:06:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 140 states have internal predecessors, (197), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 09:06:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2024-11-20 09:06:11,331 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 237 transitions. Word has length 167 [2024-11-20 09:06:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:11,331 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 237 transitions. [2024-11-20 09:06:11,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:06:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2024-11-20 09:06:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 09:06:11,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:11,333 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:06:11,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 09:06:11,334 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:11,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash 107651391, now seen corresponding path program 1 times [2024-11-20 09:06:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:11,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250883690] [2024-11-20 09:06:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:11,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:06:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:06:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:06:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:06:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:06:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:06:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:06:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:06:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:06:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:06:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:06:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:06:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:06:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:06:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 09:06:12,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:12,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250883690] [2024-11-20 09:06:12,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250883690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:12,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:12,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 09:06:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488787140] [2024-11-20 09:06:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:12,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 09:06:12,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:12,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 09:06:12,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:06:12,259 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. Second operand has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 14 states have internal predecessors, (75), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:06:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:13,442 INFO L93 Difference]: Finished difference Result 476 states and 686 transitions. [2024-11-20 09:06:13,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 09:06:13,443 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 14 states have internal predecessors, (75), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 169 [2024-11-20 09:06:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:13,445 INFO L225 Difference]: With dead ends: 476 [2024-11-20 09:06:13,445 INFO L226 Difference]: Without dead ends: 317 [2024-11-20 09:06:13,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2024-11-20 09:06:13,446 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 624 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:13,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 914 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 09:06:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-20 09:06:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 272. [2024-11-20 09:06:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 231 states have (on average 1.380952380952381) internal successors, (319), 232 states have internal predecessors, (319), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 09:06:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 395 transitions. [2024-11-20 09:06:13,475 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 395 transitions. Word has length 169 [2024-11-20 09:06:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:13,476 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 395 transitions. [2024-11-20 09:06:13,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.769230769230769) internal successors, (75), 14 states have internal predecessors, (75), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 09:06:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 395 transitions. [2024-11-20 09:06:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 09:06:13,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:13,477 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:06:13,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 09:06:13,477 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:13,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:13,477 INFO L85 PathProgramCache]: Analyzing trace with hash 530353217, now seen corresponding path program 1 times [2024-11-20 09:06:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:13,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538996131] [2024-11-20 09:06:13,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:13,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 09:06:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:06:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 09:06:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:06:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:06:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:06:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 09:06:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 09:06:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 09:06:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 09:06:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 09:06:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 09:06:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 09:06:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 09:06:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 09:06:13,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:13,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538996131] [2024-11-20 09:06:13,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538996131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:13,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:13,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:06:13,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528426533] [2024-11-20 09:06:13,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:13,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:06:13,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:13,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:06:13,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:06:13,573 INFO L87 Difference]: Start difference. First operand 272 states and 395 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:06:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:13,603 INFO L93 Difference]: Finished difference Result 545 states and 795 transitions. [2024-11-20 09:06:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:06:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2024-11-20 09:06:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:13,607 INFO L225 Difference]: With dead ends: 545 [2024-11-20 09:06:13,607 INFO L226 Difference]: Without dead ends: 276 [2024-11-20 09:06:13,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:06:13,609 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:13,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:06:13,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-20 09:06:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-20 09:06:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 235 states have (on average 1.374468085106383) internal successors, (323), 236 states have internal predecessors, (323), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-20 09:06:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 399 transitions. [2024-11-20 09:06:13,634 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 399 transitions. Word has length 169 [2024-11-20 09:06:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:13,637 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 399 transitions. [2024-11-20 09:06:13,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 09:06:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 399 transitions. [2024-11-20 09:06:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-20 09:06:13,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:13,638 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:06:13,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 09:06:13,638 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:13,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash 749207935, now seen corresponding path program 1 times [2024-11-20 09:06:13,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:13,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452497899] [2024-11-20 09:06:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:13,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:06:13,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496680894] [2024-11-20 09:06:13,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:13,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:06:13,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:06:13,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:06:13,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 09:06:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:06:15,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:06:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:06:16,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:06:16,494 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:06:16,494 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 09:06:16,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 09:06:16,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:06:16,699 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:06:16,865 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:06:16,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:06:16 BoogieIcfgContainer [2024-11-20 09:06:16,869 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:06:16,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:06:16,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:06:16,870 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:06:16,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:05:08" (3/4) ... [2024-11-20 09:06:16,872 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 09:06:16,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:06:16,874 INFO L158 Benchmark]: Toolchain (without parser) took 70187.31ms. Allocated memory was 178.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 109.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2024-11-20 09:06:16,874 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 178.3MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:06:16,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.93ms. Allocated memory is still 178.3MB. Free memory was 109.3MB in the beginning and 91.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 09:06:16,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 174.62ms. Allocated memory is still 178.3MB. Free memory was 91.0MB in the beginning and 146.8MB in the end (delta: -55.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 09:06:16,875 INFO L158 Benchmark]: Boogie Preprocessor took 61.84ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 142.8MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 09:06:16,875 INFO L158 Benchmark]: RCFGBuilder took 850.25ms. Allocated memory is still 178.3MB. Free memory was 142.8MB in the beginning and 103.8MB in the end (delta: 38.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-20 09:06:16,876 INFO L158 Benchmark]: TraceAbstraction took 68529.89ms. Allocated memory was 178.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 102.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2024-11-20 09:06:16,876 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 1.7GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 09:06:16,879 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 178.3MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.93ms. Allocated memory is still 178.3MB. Free memory was 109.3MB in the beginning and 91.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 174.62ms. Allocated memory is still 178.3MB. Free memory was 91.0MB in the beginning and 146.8MB in the end (delta: -55.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.84ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 142.8MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 850.25ms. Allocated memory is still 178.3MB. Free memory was 142.8MB in the beginning and 103.8MB in the end (delta: 38.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 68529.89ms. Allocated memory was 178.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 102.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 1.7GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 137. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L61] unsigned long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L62] unsigned long int* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L63] unsigned long int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L64] unsigned long int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L65] float* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L66] float* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L67] float* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L68] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L69] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L70] unsigned long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L71] unsigned long int* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L72] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L73] unsigned long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L74] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L75] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L76] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L77] unsigned char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=0] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L101] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L102] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L104] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L107] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L108] EXPR WrapperStruct00.var_1_5 [L108] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_5 [L108] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L109] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L110] EXPR WrapperStruct00.var_1_6 [L110] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_6 [L110] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L110] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_6 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_6 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L112] WrapperStruct00.var_1_7 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_7 [L113] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_7 [L113] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L114] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_8 [L115] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_8 [L115] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L116] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_9 [L117] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_9 [L117] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L118] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L119] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L121] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L122] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L124] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L125] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L127] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L128] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L129] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L130] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L131] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L132] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L145] RET updateVariables() [L146] CALL step() [L81] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L81] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L81] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L81] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) [L82] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L82] COND FALSE !(((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) [L85] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L85] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))) [L85] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L85] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L85] (*(WrapperStruct00_var_1_10_Pointer)) = (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))))) [L86] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L86] unsigned char stepLocal_0 = (- (*(WrapperStruct00_var_1_5_Pointer))) != 1.9f; [L87] stepLocal_0 || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L87] stepLocal_0 || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L87] COND FALSE !(stepLocal_0 || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer)))) [L90] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L90] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L92] COND FALSE !((*(WrapperStruct00_var_1_18_Pointer))) [L146] RET step() [L147] CALL, EXPR property() [L137] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) [L137] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1 [L137] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1)) && ((((- (*(WrapperStruct00_var_1_5_Pointer))) != 1.9f) || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137-L138] return (((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1)) && ((((- (*(WrapperStruct00_var_1_5_Pointer))) != 1.9f) || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer))))) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.3s, OverallIterations: 20, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6238 SdHoareTripleChecker+Valid, 17.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6223 mSDsluCounter, 12982 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10349 mSDsCounter, 537 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13097 IncrementalHoareTripleChecker+Invalid, 13634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 537 mSolverCounterUnsat, 2633 mSDtfsCounter, 13097 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 981 SyntacticMatches, 4 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=19, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 644 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 41.0s InterpolantComputationTime, 3501 NumberOfCodeBlocks, 3501 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3144 ConstructedInterpolants, 0 QuantifiedInterpolants, 52977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 14440/14440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 09:06:16,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:06:19,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:06:19,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 09:06:19,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:06:19,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:06:19,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:06:19,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:06:19,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:06:19,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:06:19,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:06:19,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:06:19,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:06:19,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:06:19,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:06:19,352 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:06:19,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:06:19,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:06:19,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:06:19,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:06:19,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:06:19,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:06:19,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:06:19,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:06:19,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 09:06:19,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 09:06:19,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:06:19,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 09:06:19,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:06:19,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:06:19,357 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:06:19,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:06:19,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:06:19,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:06:19,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:06:19,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:06:19,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:06:19,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:06:19,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:06:19,359 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 09:06:19,359 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 09:06:19,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:06:19,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:06:19,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:06:19,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:06:19,360 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 [2024-11-20 09:06:19,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:06:19,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:06:19,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:06:19,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:06:19,663 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:06:19,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-11-20 09:06:21,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:06:21,339 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:06:21,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-11-20 09:06:21,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1005fd22b/8e6338662f32421b9c2b8e245e2498e4/FLAG0f4dc6011 [2024-11-20 09:06:21,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1005fd22b/8e6338662f32421b9c2b8e245e2498e4 [2024-11-20 09:06:21,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:06:21,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:06:21,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:06:21,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:06:21,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:06:21,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:06:21" (1/1) ... [2024-11-20 09:06:21,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d492371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:21, skipping insertion in model container [2024-11-20 09:06:21,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:06:21" (1/1) ... [2024-11-20 09:06:21,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:06:21,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i[917,930] [2024-11-20 09:06:21,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:06:21,665 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:06:21,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i[917,930] [2024-11-20 09:06:21,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:06:21,743 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:06:21,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:21 WrapperNode [2024-11-20 09:06:21,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:06:21,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:06:21,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:06:21,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:06:21,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:21" (1/1) ... [2024-11-20 09:06:21,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:21" (1/1) ... [2024-11-20 09:06:21,807 INFO L138 Inliner]: procedures = 34, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 553 [2024-11-20 09:06:21,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:06:21,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:06:21,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:06:21,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:06:21,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:21" (1/1) ... [2024-11-20 09:06:21,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:21" (1/1) ... [2024-11-20 09:06:21,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:21" (1/1) ... [2024-11-20 09:06:21,852 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 36 writes are split as follows [0, 36]. [2024-11-20 09:06:21,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:21" (1/1) ... [2024-11-20 09:06:21,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:21" (1/1) ...