./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 4a390ef5 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-dev-4a390ef-m [2024-10-24 11:56:33,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:56:33,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:56:33,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:56:33,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:56:33,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:56:33,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:56:33,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:56:33,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:56:33,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:56:33,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:56:33,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:56:33,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:56:33,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:56:33,177 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:56:33,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:56:33,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:56:33,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:56:33,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:56:33,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:56:33,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:56:33,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:56:33,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:56:33,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:56:33,182 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:56:33,182 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:56:33,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:56:33,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:56:33,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:56:33,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:56:33,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:56:33,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:56:33,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:56:33,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:56:33,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:56:33,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:56:33,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:56:33,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:56:33,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:56:33,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:56:33,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:56:33,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:56:33,185 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-10-24 11:56:33,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:56:33,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:56:33,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:56:33,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:56:33,426 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:56:33,427 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-10-24 11:56:34,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:56:34,961 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:56:34,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-10-24 11:56:34,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23880e2a/1e8fff8a924e4d8cbf1b409ec9dd23d2/FLAGe9a3fe43d [2024-10-24 11:56:35,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f23880e2a/1e8fff8a924e4d8cbf1b409ec9dd23d2 [2024-10-24 11:56:35,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:56:35,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:56:35,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:56:35,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:56:35,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:56:35,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b07fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35, skipping insertion in model container [2024-10-24 11:56:35,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:56:35,516 WARN L248 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-10-24 11:56:35,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:56:35,613 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:56:35,621 WARN L248 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-10-24 11:56:35,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:56:35,674 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:56:35,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35 WrapperNode [2024-10-24 11:56:35,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:56:35,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:56:35,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:56:35,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:56:35,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,729 INFO L138 Inliner]: procedures = 29, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 552 [2024-10-24 11:56:35,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:56:35,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:56:35,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:56:35,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:56:35,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,764 INFO L175 MemorySlicer]: Split 146 memory accesses to 2 slices as follows [2, 144]. 99 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 17]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:56:35,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:56:35,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:56:35,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:56:35,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:56:35,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (1/1) ... [2024-10-24 11:56:35,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:56:35,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:56:35,835 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-10-24 11:56:35,841 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-10-24 11:56:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:56:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:56:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:56:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:56:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:56:35,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:56:35,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:56:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:56:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:56:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:56:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:56:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:56:35,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:56:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:56:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:56:35,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:56:35,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:56:35,992 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:56:35,994 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:56:36,413 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-10-24 11:56:36,413 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:56:36,449 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:56:36,450 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:56:36,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:56:36 BoogieIcfgContainer [2024-10-24 11:56:36,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:56:36,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:56:36,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:56:36,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:56:36,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:56:35" (1/3) ... [2024-10-24 11:56:36,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e80ca4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:56:36, skipping insertion in model container [2024-10-24 11:56:36,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:35" (2/3) ... [2024-10-24 11:56:36,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e80ca4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:56:36, skipping insertion in model container [2024-10-24 11:56:36,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:56:36" (3/3) ... [2024-10-24 11:56:36,458 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-23.i [2024-10-24 11:56:36,471 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:56:36,471 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:56:36,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:56:36,524 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;@5dc7d2bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:56:36,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:56:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 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-10-24 11:56:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 11:56:36,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:36,541 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] [2024-10-24 11:56:36,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:36,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1505185099, now seen corresponding path program 1 times [2024-10-24 11:56:36,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:36,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887798103] [2024-10-24 11:56:36,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:36,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:56:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:56:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:56:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:56:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:56:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:56:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:56:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:56:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:56:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:56:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:56:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:56:36,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:36,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887798103] [2024-10-24 11:56:36,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887798103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:36,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:36,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:56:36,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352411085] [2024-10-24 11:56:36,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:36,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:56:36,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:37,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:56:37,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:56:37,025 INFO L87 Difference]: Start difference. First operand has 117 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 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) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-10-24 11:56:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:37,074 INFO L93 Difference]: Finished difference Result 231 states and 370 transitions. [2024-10-24 11:56:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:56:37,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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 160 [2024-10-24 11:56:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:37,085 INFO L225 Difference]: With dead ends: 231 [2024-10-24 11:56:37,085 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 11:56:37,089 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-10-24 11:56:37,091 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:37,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:56:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 11:56:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 11:56:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 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-10-24 11:56:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2024-10-24 11:56:37,128 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 160 [2024-10-24 11:56:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:37,128 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2024-10-24 11:56:37,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 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-10-24 11:56:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2024-10-24 11:56:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 11:56:37,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:37,135 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] [2024-10-24 11:56:37,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:56:37,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:37,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:37,136 INFO L85 PathProgramCache]: Analyzing trace with hash -615857535, now seen corresponding path program 1 times [2024-10-24 11:56:37,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:37,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861010425] [2024-10-24 11:56:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:56:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:56:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:56:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:56:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:56:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:56:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:56:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:56:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:56:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:56:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:56:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:56:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:39,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861010425] [2024-10-24 11:56:39,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861010425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:39,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:39,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:56:39,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119434514] [2024-10-24 11:56:39,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:39,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:56:39,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:39,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:56:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:56:39,465 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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-10-24 11:56:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:40,275 INFO L93 Difference]: Finished difference Result 275 states and 409 transitions. [2024-10-24 11:56:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:56:40,276 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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 160 [2024-10-24 11:56:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:40,278 INFO L225 Difference]: With dead ends: 275 [2024-10-24 11:56:40,278 INFO L226 Difference]: Without dead ends: 161 [2024-10-24 11:56:40,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:56:40,280 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 242 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:40,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 593 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:56:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-24 11:56:40,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 130. [2024-10-24 11:56:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 108 states have internal predecessors, (154), 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-10-24 11:56:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2024-10-24 11:56:40,303 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 160 [2024-10-24 11:56:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:40,305 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2024-10-24 11:56:40,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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-10-24 11:56:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2024-10-24 11:56:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 11:56:40,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:40,307 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] [2024-10-24 11:56:40,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:56:40,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:40,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:40,310 INFO L85 PathProgramCache]: Analyzing trace with hash -357692097, now seen corresponding path program 1 times [2024-10-24 11:56:40,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:40,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998939552] [2024-10-24 11:56:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:56:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:56:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:56:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:56:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:56:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:56:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:56:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:56:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:56:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:56:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:56:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:56:42,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:42,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998939552] [2024-10-24 11:56:42,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998939552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:42,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:42,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:56:42,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464361276] [2024-10-24 11:56:42,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:42,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:56:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:42,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:56:42,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:56:42,262 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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-10-24 11:56:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:43,618 INFO L93 Difference]: Finished difference Result 326 states and 483 transitions. [2024-10-24 11:56:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:56:43,619 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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 160 [2024-10-24 11:56:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:43,621 INFO L225 Difference]: With dead ends: 326 [2024-10-24 11:56:43,621 INFO L226 Difference]: Without dead ends: 197 [2024-10-24 11:56:43,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:56:43,623 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 324 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:43,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 780 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:56:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-24 11:56:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 130. [2024-10-24 11:56:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 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-10-24 11:56:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2024-10-24 11:56:43,650 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 160 [2024-10-24 11:56:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:43,650 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-10-24 11:56:43,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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-10-24 11:56:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2024-10-24 11:56:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 11:56:43,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:43,652 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] [2024-10-24 11:56:43,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:56:43,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:43,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1873671427, now seen corresponding path program 1 times [2024-10-24 11:56:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:43,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367359499] [2024-10-24 11:56:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:43,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:56:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:56:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:56:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:56:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:56:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:56:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:56:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:56:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:56:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:56:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:56:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:56:45,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367359499] [2024-10-24 11:56:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367359499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:45,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:56:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604401131] [2024-10-24 11:56:45,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:45,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:56:45,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:45,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:56:45,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:56:45,626 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 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-10-24 11:56:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:46,290 INFO L93 Difference]: Finished difference Result 301 states and 447 transitions. [2024-10-24 11:56:46,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:56:46,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 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 160 [2024-10-24 11:56:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:46,293 INFO L225 Difference]: With dead ends: 301 [2024-10-24 11:56:46,293 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 11:56:46,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:56:46,297 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 306 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:46,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 659 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:56:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 11:56:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 141. [2024-10-24 11:56:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 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-10-24 11:56:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2024-10-24 11:56:46,317 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 160 [2024-10-24 11:56:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:46,319 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2024-10-24 11:56:46,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 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-10-24 11:56:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2024-10-24 11:56:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-24 11:56:46,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:46,321 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] [2024-10-24 11:56:46,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:56:46,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:46,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:46,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2131836865, now seen corresponding path program 1 times [2024-10-24 11:56:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835733026] [2024-10-24 11:56:46,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:56:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:56:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:56:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:56:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:56:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:56:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:56:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:56:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:56:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:56:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:56:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:56:47,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:47,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835733026] [2024-10-24 11:56:47,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835733026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:47,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:47,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:56:47,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219162334] [2024-10-24 11:56:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:47,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:56:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:47,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:56:47,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:56:47,987 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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-10-24 11:56:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:48,554 INFO L93 Difference]: Finished difference Result 312 states and 463 transitions. [2024-10-24 11:56:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:56:48,554 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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 160 [2024-10-24 11:56:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:48,556 INFO L225 Difference]: With dead ends: 312 [2024-10-24 11:56:48,556 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 11:56:48,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:56:48,557 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 269 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:48,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 899 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:56:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 11:56:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 141. [2024-10-24 11:56:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 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-10-24 11:56:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2024-10-24 11:56:48,575 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 160 [2024-10-24 11:56:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:48,579 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2024-10-24 11:56:48,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 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-10-24 11:56:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2024-10-24 11:56:48,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:56:48,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:48,580 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] [2024-10-24 11:56:48,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:56:48,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:48,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:48,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1547013780, now seen corresponding path program 1 times [2024-10-24 11:56:48,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:48,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868748527] [2024-10-24 11:56:48,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:48,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:56:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:56:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:56:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:56:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:56:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:56:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:56:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:56:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:53,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:56:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:54,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:56:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:56:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:56:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:54,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:56:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:54,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:56:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:54,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:56:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:56:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:56:54,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:54,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868748527] [2024-10-24 11:56:54,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868748527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:54,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:54,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:56:54,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661864537] [2024-10-24 11:56:54,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:54,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:56:54,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:54,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:56:54,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:56:54,067 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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-10-24 11:57:02,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:57:04,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:57:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:11,774 INFO L93 Difference]: Finished difference Result 360 states and 531 transitions. [2024-10-24 11:57:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:57:11,776 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:11,777 INFO L225 Difference]: With dead ends: 360 [2024-10-24 11:57:11,778 INFO L226 Difference]: Without dead ends: 220 [2024-10-24 11:57:11,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:57:11,779 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 653 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:11,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 687 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 930 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2024-10-24 11:57:11,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-24 11:57:11,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2024-10-24 11:57:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.4453125) internal successors, (185), 128 states have internal predecessors, (185), 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-10-24 11:57:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2024-10-24 11:57:11,796 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 162 [2024-10-24 11:57:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:11,798 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2024-10-24 11:57:11,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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-10-24 11:57:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2024-10-24 11:57:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:57:11,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:11,799 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] [2024-10-24 11:57:11,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:57:11,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:11,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:11,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1288848342, now seen corresponding path program 1 times [2024-10-24 11:57:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:11,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224202512] [2024-10-24 11:57:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:13,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:13,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224202512] [2024-10-24 11:57:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224202512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:57:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401731375] [2024-10-24 11:57:13,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:13,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:57:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:13,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:57:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:57:13,715 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-10-24 11:57:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:14,730 INFO L93 Difference]: Finished difference Result 365 states and 540 transitions. [2024-10-24 11:57:14,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:57:14,734 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:14,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:14,735 INFO L225 Difference]: With dead ends: 365 [2024-10-24 11:57:14,736 INFO L226 Difference]: Without dead ends: 216 [2024-10-24 11:57:14,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:57:14,737 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 533 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:14,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 479 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:57:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-24 11:57:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 150. [2024-10-24 11:57:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.4375) internal successors, (184), 128 states have internal predecessors, (184), 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-10-24 11:57:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 224 transitions. [2024-10-24 11:57:14,769 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 224 transitions. Word has length 162 [2024-10-24 11:57:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:14,769 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 224 transitions. [2024-10-24 11:57:14,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-10-24 11:57:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 224 transitions. [2024-10-24 11:57:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:57:14,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:14,771 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] [2024-10-24 11:57:14,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:57:14,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:14,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1905229777, now seen corresponding path program 1 times [2024-10-24 11:57:14,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:14,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49147132] [2024-10-24 11:57:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:14,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49147132] [2024-10-24 11:57:14,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49147132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:14,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:14,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:57:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10819804] [2024-10-24 11:57:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:14,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:57:14,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:14,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:57:14,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:57:14,939 INFO L87 Difference]: Start difference. First operand 150 states and 224 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-10-24 11:57:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:14,983 INFO L93 Difference]: Finished difference Result 302 states and 451 transitions. [2024-10-24 11:57:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:57:14,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:14,985 INFO L225 Difference]: With dead ends: 302 [2024-10-24 11:57:14,985 INFO L226 Difference]: Without dead ends: 153 [2024-10-24 11:57:14,986 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-10-24 11:57:14,986 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:14,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 645 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:57:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-24 11:57:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-10-24 11:57:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 131 states have internal predecessors, (187), 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-10-24 11:57:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 227 transitions. [2024-10-24 11:57:15,000 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 227 transitions. Word has length 162 [2024-10-24 11:57:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:15,001 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 227 transitions. [2024-10-24 11:57:15,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-10-24 11:57:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 227 transitions. [2024-10-24 11:57:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:57:15,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:15,003 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] [2024-10-24 11:57:15,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:57:15,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:15,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1124311954, now seen corresponding path program 1 times [2024-10-24 11:57:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:15,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693779317] [2024-10-24 11:57:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:15,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693779317] [2024-10-24 11:57:16,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693779317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:16,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:57:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534068527] [2024-10-24 11:57:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:16,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:57:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:16,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:57:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:57:16,380 INFO L87 Difference]: Start difference. First operand 153 states and 227 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-10-24 11:57:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:17,183 INFO L93 Difference]: Finished difference Result 341 states and 502 transitions. [2024-10-24 11:57:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:57:17,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:17,190 INFO L225 Difference]: With dead ends: 341 [2024-10-24 11:57:17,190 INFO L226 Difference]: Without dead ends: 189 [2024-10-24 11:57:17,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:57:17,191 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 384 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:17,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 651 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:57:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-24 11:57:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 144. [2024-10-24 11:57:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.4180327868852458) internal successors, (173), 122 states have internal predecessors, (173), 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-10-24 11:57:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2024-10-24 11:57:17,207 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 162 [2024-10-24 11:57:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:17,207 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2024-10-24 11:57:17,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-10-24 11:57:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2024-10-24 11:57:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:57:17,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:17,209 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] [2024-10-24 11:57:17,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:57:17,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:17,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:17,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1067653372, now seen corresponding path program 1 times [2024-10-24 11:57:17,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:17,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694091380] [2024-10-24 11:57:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:18,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694091380] [2024-10-24 11:57:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694091380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:18,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:18,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:57:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710314717] [2024-10-24 11:57:18,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:18,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:57:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:18,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:57:18,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:57:18,523 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-10-24 11:57:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:19,072 INFO L93 Difference]: Finished difference Result 338 states and 497 transitions. [2024-10-24 11:57:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:57:19,073 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:19,074 INFO L225 Difference]: With dead ends: 338 [2024-10-24 11:57:19,074 INFO L226 Difference]: Without dead ends: 195 [2024-10-24 11:57:19,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:57:19,075 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 398 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:19,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 703 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:57:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-24 11:57:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2024-10-24 11:57:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 135 states have internal predecessors, (194), 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-10-24 11:57:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 234 transitions. [2024-10-24 11:57:19,090 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 234 transitions. Word has length 162 [2024-10-24 11:57:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:19,091 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 234 transitions. [2024-10-24 11:57:19,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-10-24 11:57:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2024-10-24 11:57:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:57:19,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:19,092 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] [2024-10-24 11:57:19,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:57:19,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:19,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1325818810, now seen corresponding path program 1 times [2024-10-24 11:57:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:19,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549615306] [2024-10-24 11:57:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:19,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:20,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:20,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549615306] [2024-10-24 11:57:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549615306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:20,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:20,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:57:20,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868372408] [2024-10-24 11:57:20,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:20,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:57:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:57:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:57:20,731 INFO L87 Difference]: Start difference. First operand 157 states and 234 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-10-24 11:57:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:22,053 INFO L93 Difference]: Finished difference Result 397 states and 584 transitions. [2024-10-24 11:57:22,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:57:22,054 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:22,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:22,055 INFO L225 Difference]: With dead ends: 397 [2024-10-24 11:57:22,055 INFO L226 Difference]: Without dead ends: 241 [2024-10-24 11:57:22,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:57:22,056 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 382 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:22,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 764 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:57:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-24 11:57:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 155. [2024-10-24 11:57:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.4360902255639099) internal successors, (191), 133 states have internal predecessors, (191), 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-10-24 11:57:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 231 transitions. [2024-10-24 11:57:22,068 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 231 transitions. Word has length 162 [2024-10-24 11:57:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:22,069 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 231 transitions. [2024-10-24 11:57:22,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-10-24 11:57:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 231 transitions. [2024-10-24 11:57:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:57:22,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:22,071 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] [2024-10-24 11:57:22,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:57:22,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:22,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:22,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1406465170, now seen corresponding path program 1 times [2024-10-24 11:57:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:22,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791996366] [2024-10-24 11:57:22,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:22,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791996366] [2024-10-24 11:57:23,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791996366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:23,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:23,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:57:23,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785695690] [2024-10-24 11:57:23,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:23,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:57:23,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:23,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:57:23,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:57:23,627 INFO L87 Difference]: Start difference. First operand 155 states and 231 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 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-10-24 11:57:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:24,267 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2024-10-24 11:57:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:57:24,268 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:24,269 INFO L225 Difference]: With dead ends: 345 [2024-10-24 11:57:24,269 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 11:57:24,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:57:24,270 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 252 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:24,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 733 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:57:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 11:57:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2024-10-24 11:57:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 135 states have internal predecessors, (193), 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-10-24 11:57:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2024-10-24 11:57:24,293 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 162 [2024-10-24 11:57:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:24,293 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2024-10-24 11:57:24,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 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-10-24 11:57:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2024-10-24 11:57:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:57:24,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:24,295 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] [2024-10-24 11:57:24,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:57:24,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:24,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:24,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1148299732, now seen corresponding path program 1 times [2024-10-24 11:57:24,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:24,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923291584] [2024-10-24 11:57:24,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:25,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:25,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923291584] [2024-10-24 11:57:25,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923291584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:25,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:25,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:57:25,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067230146] [2024-10-24 11:57:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:25,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:57:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:57:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:57:25,808 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-10-24 11:57:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:26,394 INFO L93 Difference]: Finished difference Result 347 states and 511 transitions. [2024-10-24 11:57:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:57:26,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:26,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:26,399 INFO L225 Difference]: With dead ends: 347 [2024-10-24 11:57:26,399 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 11:57:26,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:57:26,400 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 266 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:26,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 970 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:57:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 11:57:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 155. [2024-10-24 11:57:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.4360902255639099) internal successors, (191), 133 states have internal predecessors, (191), 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-10-24 11:57:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 231 transitions. [2024-10-24 11:57:26,412 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 231 transitions. Word has length 162 [2024-10-24 11:57:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:26,413 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 231 transitions. [2024-10-24 11:57:26,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-10-24 11:57:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 231 transitions. [2024-10-24 11:57:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:57:26,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:26,414 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] [2024-10-24 11:57:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:57:26,414 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1208201982, now seen corresponding path program 1 times [2024-10-24 11:57:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138679445] [2024-10-24 11:57:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:26,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:26,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138679445] [2024-10-24 11:57:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138679445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:26,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:26,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:57:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885862466] [2024-10-24 11:57:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:26,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:57:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:57:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:57:26,835 INFO L87 Difference]: Start difference. First operand 155 states and 231 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-10-24 11:57:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:27,104 INFO L93 Difference]: Finished difference Result 309 states and 461 transitions. [2024-10-24 11:57:27,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:57:27,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:27,106 INFO L225 Difference]: With dead ends: 309 [2024-10-24 11:57:27,107 INFO L226 Difference]: Without dead ends: 155 [2024-10-24 11:57:27,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:57:27,109 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 125 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:27,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 454 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:57:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-24 11:57:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-24 11:57:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.4285714285714286) internal successors, (190), 133 states have internal predecessors, (190), 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-10-24 11:57:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2024-10-24 11:57:27,143 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 162 [2024-10-24 11:57:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:27,143 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2024-10-24 11:57:27,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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-10-24 11:57:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2024-10-24 11:57:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:57:27,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:27,144 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] [2024-10-24 11:57:27,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:57:27,147 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:27,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1427056700, now seen corresponding path program 1 times [2024-10-24 11:57:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067761685] [2024-10-24 11:57:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:28,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:28,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067761685] [2024-10-24 11:57:28,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067761685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:28,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:28,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:57:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332465569] [2024-10-24 11:57:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:28,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:57:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:28,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:57:28,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:57:28,518 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-10-24 11:57:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:29,175 INFO L93 Difference]: Finished difference Result 355 states and 524 transitions. [2024-10-24 11:57:29,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:57:29,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:29,177 INFO L225 Difference]: With dead ends: 355 [2024-10-24 11:57:29,177 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 11:57:29,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:57:29,178 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 412 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:29,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 428 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:57:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 11:57:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 167. [2024-10-24 11:57:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 145 states have (on average 1.4137931034482758) internal successors, (205), 145 states have internal predecessors, (205), 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-10-24 11:57:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2024-10-24 11:57:29,192 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 162 [2024-10-24 11:57:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:29,192 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2024-10-24 11:57:29,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-10-24 11:57:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2024-10-24 11:57:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 11:57:29,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:29,193 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] [2024-10-24 11:57:29,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:57:29,193 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:29,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1685222138, now seen corresponding path program 1 times [2024-10-24 11:57:29,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:29,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284160292] [2024-10-24 11:57:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:29,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:30,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:30,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284160292] [2024-10-24 11:57:30,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284160292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:30,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:57:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123517852] [2024-10-24 11:57:30,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:30,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:57:30,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:57:30,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:57:30,295 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-10-24 11:57:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:30,876 INFO L93 Difference]: Finished difference Result 369 states and 537 transitions. [2024-10-24 11:57:30,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:57:30,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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 162 [2024-10-24 11:57:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:30,881 INFO L225 Difference]: With dead ends: 369 [2024-10-24 11:57:30,881 INFO L226 Difference]: Without dead ends: 203 [2024-10-24 11:57:30,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:57:30,882 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 218 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:30,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1067 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:57:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-24 11:57:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 165. [2024-10-24 11:57:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 143 states have (on average 1.4195804195804196) internal successors, (203), 143 states have internal predecessors, (203), 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-10-24 11:57:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2024-10-24 11:57:30,897 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 162 [2024-10-24 11:57:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:30,898 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2024-10-24 11:57:30,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-10-24 11:57:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2024-10-24 11:57:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 11:57:30,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:30,899 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] [2024-10-24 11:57:30,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:57:30,899 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:30,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1601071348, now seen corresponding path program 1 times [2024-10-24 11:57:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:30,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884539150] [2024-10-24 11:57:30,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884539150] [2024-10-24 11:57:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884539150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:31,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:31,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:57:31,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995999166] [2024-10-24 11:57:31,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:31,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:57:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:31,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:57:31,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:57:31,885 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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-10-24 11:57:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:32,491 INFO L93 Difference]: Finished difference Result 403 states and 593 transitions. [2024-10-24 11:57:32,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:57:32,492 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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 164 [2024-10-24 11:57:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:32,493 INFO L225 Difference]: With dead ends: 403 [2024-10-24 11:57:32,493 INFO L226 Difference]: Without dead ends: 239 [2024-10-24 11:57:32,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:57:32,494 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 313 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:32,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 874 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:57:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-24 11:57:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 212. [2024-10-24 11:57:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 190 states have (on average 1.4421052631578948) internal successors, (274), 190 states have internal predecessors, (274), 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-10-24 11:57:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 314 transitions. [2024-10-24 11:57:32,510 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 314 transitions. Word has length 164 [2024-10-24 11:57:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:32,510 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 314 transitions. [2024-10-24 11:57:32,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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-10-24 11:57:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 314 transitions. [2024-10-24 11:57:32,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 11:57:32,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:32,511 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] [2024-10-24 11:57:32,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:57:32,512 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:32,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2013837578, now seen corresponding path program 1 times [2024-10-24 11:57:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939868033] [2024-10-24 11:57:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:33,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:33,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939868033] [2024-10-24 11:57:33,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939868033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:33,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:33,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:57:33,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682423415] [2024-10-24 11:57:33,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:33,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:57:33,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:33,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:57:33,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:57:33,709 INFO L87 Difference]: Start difference. First operand 212 states and 314 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-10-24 11:57:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:34,233 INFO L93 Difference]: Finished difference Result 449 states and 662 transitions. [2024-10-24 11:57:34,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:57:34,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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 164 [2024-10-24 11:57:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:34,238 INFO L225 Difference]: With dead ends: 449 [2024-10-24 11:57:34,238 INFO L226 Difference]: Without dead ends: 238 [2024-10-24 11:57:34,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:57:34,240 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 257 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:34,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 363 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:57:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-24 11:57:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 212. [2024-10-24 11:57:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 190 states have (on average 1.436842105263158) internal successors, (273), 190 states have internal predecessors, (273), 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-10-24 11:57:34,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 313 transitions. [2024-10-24 11:57:34,257 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 313 transitions. Word has length 164 [2024-10-24 11:57:34,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:34,257 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 313 transitions. [2024-10-24 11:57:34,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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-10-24 11:57:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 313 transitions. [2024-10-24 11:57:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 11:57:34,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:34,258 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] [2024-10-24 11:57:34,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:57:34,258 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:34,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:34,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1069148854, now seen corresponding path program 1 times [2024-10-24 11:57:34,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:34,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534488286] [2024-10-24 11:57:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:34,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 11:57:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534488286] [2024-10-24 11:57:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534488286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:34,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 11:57:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330200094] [2024-10-24 11:57:34,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:34,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:57:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:34,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:57:34,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:57:34,991 INFO L87 Difference]: Start difference. First operand 212 states and 313 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), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-24 11:57:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:35,943 INFO L93 Difference]: Finished difference Result 618 states and 892 transitions. [2024-10-24 11:57:35,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:57:35,944 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), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 164 [2024-10-24 11:57:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:35,946 INFO L225 Difference]: With dead ends: 618 [2024-10-24 11:57:35,946 INFO L226 Difference]: Without dead ends: 407 [2024-10-24 11:57:35,947 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-10-24 11:57:35,948 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 496 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:35,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 760 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:57:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-24 11:57:35,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 345. [2024-10-24 11:57:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 304 states have (on average 1.3980263157894737) internal successors, (425), 305 states have internal predecessors, (425), 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-10-24 11:57:35,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 501 transitions. [2024-10-24 11:57:35,989 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 501 transitions. Word has length 164 [2024-10-24 11:57:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:35,989 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 501 transitions. [2024-10-24 11:57:35,989 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), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-24 11:57:35,989 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 501 transitions. [2024-10-24 11:57:35,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 11:57:35,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:35,990 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] [2024-10-24 11:57:35,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:57:35,991 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:35,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:35,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1886797304, now seen corresponding path program 1 times [2024-10-24 11:57:35,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:35,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570716305] [2024-10-24 11:57:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:35,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:57:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:57:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:57:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:57:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:57:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:57:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:57:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:57:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:57:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:57:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:57:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:57:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:57:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:57:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:57:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:57:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:57:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 11:57:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 11:57:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 11:57:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 11:57:36,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:57:36,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570716305] [2024-10-24 11:57:36,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570716305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:36,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:36,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:36,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704052552] [2024-10-24 11:57:36,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:36,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:36,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:57:36,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:36,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:36,069 INFO L87 Difference]: Start difference. First operand 345 states and 501 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-10-24 11:57:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:36,109 INFO L93 Difference]: Finished difference Result 698 states and 1019 transitions. [2024-10-24 11:57:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 164 [2024-10-24 11:57:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:36,112 INFO L225 Difference]: With dead ends: 698 [2024-10-24 11:57:36,112 INFO L226 Difference]: Without dead ends: 354 [2024-10-24 11:57:36,114 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-10-24 11:57:36,114 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:36,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:57:36,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-24 11:57:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-24 11:57:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 313 states have (on average 1.3865814696485623) internal successors, (434), 314 states have internal predecessors, (434), 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-10-24 11:57:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 510 transitions. [2024-10-24 11:57:36,145 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 510 transitions. Word has length 164 [2024-10-24 11:57:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:36,146 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 510 transitions. [2024-10-24 11:57:36,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-10-24 11:57:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 510 transitions. [2024-10-24 11:57:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 11:57:36,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:36,147 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] [2024-10-24 11:57:36,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:57:36,147 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:36,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:36,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1464095478, now seen corresponding path program 1 times [2024-10-24 11:57:36,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:57:36,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302430368] [2024-10-24 11:57:36,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:36,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:57:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:57:36,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542327081] [2024-10-24 11:57:36,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:36,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:57:36,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:57:36,265 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-10-24 11:57:36,266 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-10-24 11:57:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:57:36,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:57:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:57:37,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:57:37,590 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:57:37,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:57:37,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:37,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-24 11:57:37,797 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, 1] [2024-10-24 11:57:37,944 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:57:37,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:57:37 BoogieIcfgContainer [2024-10-24 11:57:37,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:57:37,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:57:37,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:57:37,946 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:57:37,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:56:36" (3/4) ... [2024-10-24 11:57:37,949 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:57:37,950 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:57:37,951 INFO L158 Benchmark]: Toolchain (without parser) took 62597.06ms. Allocated memory was 167.8MB in the beginning and 809.5MB in the end (delta: 641.7MB). Free memory was 101.7MB in the beginning and 674.1MB in the end (delta: -572.4MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2024-10-24 11:57:37,951 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:57:37,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.02ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 133.7MB in the end (delta: -32.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-24 11:57:37,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.20ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 129.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:57:37,954 INFO L158 Benchmark]: Boogie Preprocessor took 62.23ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 124.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:57:37,955 INFO L158 Benchmark]: RCFGBuilder took 657.50ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 82.7MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-24 11:57:37,955 INFO L158 Benchmark]: TraceAbstraction took 61493.55ms. Allocated memory was 167.8MB in the beginning and 809.5MB in the end (delta: 641.7MB). Free memory was 82.0MB in the beginning and 674.1MB in the end (delta: -592.1MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2024-10-24 11:57:37,955 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 809.5MB. Free memory is still 674.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:57:37,956 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.16ms. Allocated memory is still 104.9MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.02ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 133.7MB in the end (delta: -32.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.20ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 129.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.23ms. Allocated memory is still 167.8MB. Free memory was 129.5MB in the beginning and 124.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 657.50ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 82.7MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 61493.55ms. Allocated memory was 167.8MB in the beginning and 809.5MB in the end (delta: 641.7MB). Free memory was 82.0MB in the beginning and 674.1MB in the end (delta: -592.1MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 809.5MB. Free memory is still 674.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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 }; [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); [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 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 [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] 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 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 [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] 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 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 [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] 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 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 [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] 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 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 [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] 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))) 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] 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) 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)))))))) 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) 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] 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, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.3s, OverallIterations: 21, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 5831 SdHoareTripleChecker+Valid, 16.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5830 mSDsluCounter, 13003 SdHoareTripleChecker+Invalid, 15.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10278 mSDsCounter, 329 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11828 IncrementalHoareTripleChecker+Invalid, 12158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 329 mSolverCounterUnsat, 2725 mSDtfsCounter, 11828 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1138 GetRequests, 870 SyntacticMatches, 6 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=20, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 720 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 3566 NumberOfCodeBlocks, 3566 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3218 ConstructedInterpolants, 0 QuantifiedInterpolants, 51109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 15200/15200 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-10-24 11:57:38,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-dev-4a390ef-m [2024-10-24 11:57:39,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:57:40,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:57:40,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:57:40,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:57:40,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:57:40,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:57:40,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:57:40,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:57:40,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:57:40,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:57:40,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:57:40,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:57:40,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:57:40,072 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:57:40,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:57:40,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:57:40,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:57:40,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:57:40,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:57:40,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:57:40,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:57:40,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:57:40,078 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:57:40,078 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:57:40,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:57:40,079 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:57:40,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:57:40,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:57:40,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:57:40,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:57:40,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:57:40,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:57:40,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:57:40,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:57:40,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:57:40,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:57:40,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:57:40,081 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:57:40,082 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:57:40,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:57:40,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:57:40,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:57:40,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:57:40,083 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:57:40,083 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-10-24 11:57:40,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:57:40,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:57:40,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:57:40,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:57:40,390 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:57:40,391 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-10-24 11:57:41,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:57:41,948 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:57:41,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-10-24 11:57:41,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb5a68b0/11ad34b674f6405080dc33cb552ef907/FLAGc98a8831f [2024-10-24 11:57:41,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb5a68b0/11ad34b674f6405080dc33cb552ef907 [2024-10-24 11:57:41,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:57:41,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:57:41,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:57:41,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:57:41,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:57:41,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:57:41" (1/1) ... [2024-10-24 11:57:41,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acc59c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:41, skipping insertion in model container [2024-10-24 11:57:41,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:57:41" (1/1) ... [2024-10-24 11:57:42,022 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:57:42,181 WARN L248 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-10-24 11:57:42,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:57:42,287 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:57:42,299 WARN L248 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-10-24 11:57:42,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:57:42,373 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:57:42,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42 WrapperNode [2024-10-24 11:57:42,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:57:42,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:57:42,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:57:42,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:57:42,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,445 INFO L138 Inliner]: procedures = 33, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 552 [2024-10-24 11:57:42,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:57:42,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:57:42,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:57:42,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:57:42,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,481 INFO L175 MemorySlicer]: Split 146 memory accesses to 2 slices as follows [2, 144]. 99 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 17]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:57:42,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:57:42,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:57:42,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:57:42,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:57:42,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:42" (1/1) ... [2024-10-24 11:57:42,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:57:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:57:42,556 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-10-24 11:57:42,558 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-10-24 11:57:42,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:57:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:57:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:57:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:57:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:57:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:57:42,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:57:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:57:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:57:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:57:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:57:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:57:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:57:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:57:42,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:57:42,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:57:42,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:57:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:57:42,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:57:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:57:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:57:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:57:42,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:57:42,728 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:57:42,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation