./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 d1b834b0c672fe89129f134ed175bc47986b842eb441fdde200e666204d40818 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:25:38,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:25:38,997 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:25:39,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:25:39,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:25:39,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:25:39,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:25:39,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:25:39,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:25:39,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:25:39,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:25:39,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:25:39,048 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:25:39,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:25:39,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:25:39,049 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:25:39,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:25:39,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:25:39,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:25:39,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:25:39,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:25:39,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:25:39,053 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:25:39,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:25:39,054 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:25:39,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:25:39,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:25:39,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:25:39,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:39,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:25:39,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:25:39,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:25:39,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:25:39,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:25:39,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:25:39,059 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:25:39,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:25:39,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:25:39,060 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:25:39,061 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> d1b834b0c672fe89129f134ed175bc47986b842eb441fdde200e666204d40818 [2023-11-06 22:25:39,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:25:39,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:25:39,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:25:39,461 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:25:39,462 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:25:39,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i [2023-11-06 22:25:42,549 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:25:42,893 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:25:42,893 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i [2023-11-06 22:25:42,934 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/data/736e64d0f/11a44ee3ced34432b2ca0501dd51c9d2/FLAGf9b63d504 [2023-11-06 22:25:42,958 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/data/736e64d0f/11a44ee3ced34432b2ca0501dd51c9d2 [2023-11-06 22:25:42,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:25:42,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:25:42,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:42,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:25:42,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:25:42,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:42" (1/1) ... [2023-11-06 22:25:42,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0bcfca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:42, skipping insertion in model container [2023-11-06 22:25:42,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:25:42" (1/1) ... [2023-11-06 22:25:43,048 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:25:43,270 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i[916,929] [2023-11-06 22:25:43,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:43,355 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:25:43,369 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i[916,929] [2023-11-06 22:25:43,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:25:43,473 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:25:43,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43 WrapperNode [2023-11-06 22:25:43,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:25:43,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:43,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:25:43,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:25:43,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,588 INFO L138 Inliner]: procedures = 29, calls = 194, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 531 [2023-11-06 22:25:43,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:25:43,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:25:43,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:25:43,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:25:43,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:25:43,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:25:43,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:25:43,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:25:43,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (1/1) ... [2023-11-06 22:25:43,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:43,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:25:43,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:25:43,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:25:43,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:25:43,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:25:43,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:25:43,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:25:43,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:25:43,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:25:43,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:25:43,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:25:43,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:25:43,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:25:43,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:25:44,034 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:25:44,037 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:25:44,705 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:25:44,731 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:25:44,731 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:25:44,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:44 BoogieIcfgContainer [2023-11-06 22:25:44,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:25:44,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:25:44,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:25:44,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:25:44,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:25:42" (1/3) ... [2023-11-06 22:25:44,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b7b5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:44, skipping insertion in model container [2023-11-06 22:25:44,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:25:43" (2/3) ... [2023-11-06 22:25:44,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b7b5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:25:44, skipping insertion in model container [2023-11-06 22:25:44,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:44" (3/3) ... [2023-11-06 22:25:44,748 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-23.i [2023-11-06 22:25:44,769 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:25:44,769 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:25:44,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:25:44,836 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3b2c89a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:25:44,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:25:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:25:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-06 22:25:44,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:44,866 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:44,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:44,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1279411170, now seen corresponding path program 1 times [2023-11-06 22:25:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:44,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448449394] [2023-11-06 22:25:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:25:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:25:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:25:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:25:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:25:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:25:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:25:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:25:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:25:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:25:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:25:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:25:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:25:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:25:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:25:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:25:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:25:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:25:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:25:45,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:45,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448449394] [2023-11-06 22:25:45,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448449394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:45,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:45,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:25:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984405719] [2023-11-06 22:25:45,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:45,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:25:45,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:25:45,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:25:45,750 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:25:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:45,794 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2023-11-06 22:25:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:25:45,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2023-11-06 22:25:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:45,812 INFO L225 Difference]: With dead ends: 241 [2023-11-06 22:25:45,812 INFO L226 Difference]: Without dead ends: 120 [2023-11-06 22:25:45,819 INFO L412 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 [2023-11-06 22:25:45,824 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:45,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-06 22:25:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-06 22:25:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:25:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2023-11-06 22:25:45,931 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2023-11-06 22:25:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:45,933 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2023-11-06 22:25:45,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:25:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2023-11-06 22:25:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-06 22:25:45,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:45,942 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:45,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:25:45,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:45,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:45,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1334114070, now seen corresponding path program 1 times [2023-11-06 22:25:45,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:45,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931307749] [2023-11-06 22:25:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:45,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:25:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:25:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:25:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:25:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:25:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:25:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:25:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:25:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:25:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:25:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:25:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:25:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:25:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:25:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:25:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:25:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:25:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:25:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:25:46,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931307749] [2023-11-06 22:25:46,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931307749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:46,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:46,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:25:46,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272376743] [2023-11-06 22:25:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:46,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:25:46,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:46,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:25:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:25:46,632 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:25:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:46,752 INFO L93 Difference]: Finished difference Result 243 states and 358 transitions. [2023-11-06 22:25:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:25:46,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2023-11-06 22:25:46,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:46,759 INFO L225 Difference]: With dead ends: 243 [2023-11-06 22:25:46,759 INFO L226 Difference]: Without dead ends: 126 [2023-11-06 22:25:46,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:25:46,766 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:46,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 516 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:25:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-06 22:25:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2023-11-06 22:25:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:25:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2023-11-06 22:25:46,795 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 165 [2023-11-06 22:25:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:46,798 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2023-11-06 22:25:46,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:25:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2023-11-06 22:25:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-06 22:25:46,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:46,811 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:46,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:25:46,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:46,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash 699279976, now seen corresponding path program 1 times [2023-11-06 22:25:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:46,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424141442] [2023-11-06 22:25:46,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:46,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:25:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:25:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:25:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:25:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:25:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:25:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:25:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:25:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:25:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:25:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:25:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:25:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:25:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:25:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:25:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:25:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:25:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:25:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:25:50,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:50,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424141442] [2023-11-06 22:25:50,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424141442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:50,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:50,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:25:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312396556] [2023-11-06 22:25:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:50,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:25:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:50,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:25:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:25:50,671 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 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) [2023-11-06 22:25:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:51,781 INFO L93 Difference]: Finished difference Result 311 states and 456 transitions. [2023-11-06 22:25:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:25:51,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 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 165 [2023-11-06 22:25:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:51,787 INFO L225 Difference]: With dead ends: 311 [2023-11-06 22:25:51,787 INFO L226 Difference]: Without dead ends: 192 [2023-11-06 22:25:51,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:25:51,794 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 410 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:51,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 916 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:25:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-06 22:25:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2023-11-06 22:25:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.4) internal successors, (161), 115 states have internal predecessors, (161), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:25:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2023-11-06 22:25:51,836 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 201 transitions. Word has length 165 [2023-11-06 22:25:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:51,844 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 201 transitions. [2023-11-06 22:25:51,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 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) [2023-11-06 22:25:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2023-11-06 22:25:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-06 22:25:51,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:51,849 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:51,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:25:51,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:51,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 112473962, now seen corresponding path program 1 times [2023-11-06 22:25:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394214936] [2023-11-06 22:25:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:25:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:25:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:25:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:25:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:25:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:25:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:25:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:25:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:25:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:25:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:25:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:25:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:25:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:25:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:25:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:25:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:25:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:25:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:25:54,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:54,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394214936] [2023-11-06 22:25:54,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394214936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:54,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:54,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:25:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301627374] [2023-11-06 22:25:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:54,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:25:54,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:54,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:25:54,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:25:54,835 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) [2023-11-06 22:25:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:55,634 INFO L93 Difference]: Finished difference Result 326 states and 478 transitions. [2023-11-06 22:25:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:25:55,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 165 [2023-11-06 22:25:55,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:55,640 INFO L225 Difference]: With dead ends: 326 [2023-11-06 22:25:55,640 INFO L226 Difference]: Without dead ends: 192 [2023-11-06 22:25:55,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:25:55,646 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 369 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:55,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 496 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:25:55,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-06 22:25:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2023-11-06 22:25:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.391304347826087) internal successors, (160), 115 states have internal predecessors, (160), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:25:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2023-11-06 22:25:55,688 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 165 [2023-11-06 22:25:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:55,689 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2023-11-06 22:25:55,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) [2023-11-06 22:25:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2023-11-06 22:25:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-06 22:25:55,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:55,692 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:55,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:25:55,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:55,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash 565266470, now seen corresponding path program 1 times [2023-11-06 22:25:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677736330] [2023-11-06 22:25:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:25:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:25:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:25:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:25:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:25:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:25:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:25:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:25:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:25:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:25:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:25:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:25:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:25:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:25:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:25:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:25:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:25:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:25:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:25:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:25:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:25:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:25:58,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:25:58,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677736330] [2023-11-06 22:25:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677736330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:25:58,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:25:58,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:25:58,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157227401] [2023-11-06 22:25:58,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:25:58,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:25:58,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:25:58,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:25:58,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:25:58,592 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) [2023-11-06 22:25:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:25:59,854 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2023-11-06 22:25:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:25:59,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 165 [2023-11-06 22:25:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:25:59,858 INFO L225 Difference]: With dead ends: 315 [2023-11-06 22:25:59,858 INFO L226 Difference]: Without dead ends: 181 [2023-11-06 22:25:59,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:25:59,860 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 247 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:25:59,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 709 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:25:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-06 22:25:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2023-11-06 22:25:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:25:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2023-11-06 22:25:59,889 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 165 [2023-11-06 22:25:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:25:59,890 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2023-11-06 22:25:59,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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) [2023-11-06 22:25:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2023-11-06 22:25:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-06 22:25:59,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:25:59,893 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:25:59,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:25:59,894 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:25:59,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:25:59,895 INFO L85 PathProgramCache]: Analyzing trace with hash -21539544, now seen corresponding path program 1 times [2023-11-06 22:25:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:25:59,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050936269] [2023-11-06 22:25:59,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:25:59,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:02,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:02,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050936269] [2023-11-06 22:26:02,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050936269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:02,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:02,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:26:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537738141] [2023-11-06 22:26:02,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:02,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:26:02,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:02,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:26:02,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:26:02,370 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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) [2023-11-06 22:26:03,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:03,232 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2023-11-06 22:26:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:26:03,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 165 [2023-11-06 22:26:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:03,235 INFO L225 Difference]: With dead ends: 326 [2023-11-06 22:26:03,236 INFO L226 Difference]: Without dead ends: 181 [2023-11-06 22:26:03,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:26:03,238 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 352 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:03,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 925 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:26:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-06 22:26:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2023-11-06 22:26:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2023-11-06 22:26:03,269 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 165 [2023-11-06 22:26:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:03,270 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2023-11-06 22:26:03,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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) [2023-11-06 22:26:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2023-11-06 22:26:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-06 22:26:03,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:03,275 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:03,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:26:03,276 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:03,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash -575774022, now seen corresponding path program 1 times [2023-11-06 22:26:03,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:03,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034340618] [2023-11-06 22:26:03,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:03,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:03,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:03,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034340618] [2023-11-06 22:26:03,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034340618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:03,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:03,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:26:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364745605] [2023-11-06 22:26:03,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:03,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:03,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:03,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:03,645 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:03,715 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2023-11-06 22:26:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:26:03,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-11-06 22:26:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:03,719 INFO L225 Difference]: With dead ends: 312 [2023-11-06 22:26:03,719 INFO L226 Difference]: Without dead ends: 167 [2023-11-06 22:26:03,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:03,721 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 61 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:03,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 711 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-06 22:26:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2023-11-06 22:26:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 129 states have internal predecessors, (180), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2023-11-06 22:26:03,746 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 167 [2023-11-06 22:26:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:03,746 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2023-11-06 22:26:03,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2023-11-06 22:26:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-06 22:26:03,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:03,750 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:03,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:26:03,750 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:03,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1938987293, now seen corresponding path program 1 times [2023-11-06 22:26:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:03,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862154518] [2023-11-06 22:26:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:06,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:06,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862154518] [2023-11-06 22:26:06,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862154518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:06,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:06,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:26:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792924922] [2023-11-06 22:26:06,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:06,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:26:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:06,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:26:06,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:26:06,324 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:07,248 INFO L93 Difference]: Finished difference Result 366 states and 530 transitions. [2023-11-06 22:26:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:26:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-11-06 22:26:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:07,252 INFO L225 Difference]: With dead ends: 366 [2023-11-06 22:26:07,252 INFO L226 Difference]: Without dead ends: 218 [2023-11-06 22:26:07,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:26:07,253 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 481 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:07,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 949 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:26:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-06 22:26:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 153. [2023-11-06 22:26:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 131 states have internal predecessors, (183), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2023-11-06 22:26:07,278 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 167 [2023-11-06 22:26:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:07,279 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2023-11-06 22:26:07,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2023-11-06 22:26:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-06 22:26:07,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:07,282 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:07,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:26:07,283 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:07,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1352181279, now seen corresponding path program 1 times [2023-11-06 22:26:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:07,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294260367] [2023-11-06 22:26:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:10,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:10,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294260367] [2023-11-06 22:26:10,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294260367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:10,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:10,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:26:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559638338] [2023-11-06 22:26:10,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:10,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:26:10,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:10,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:26:10,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:26:10,123 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:11,071 INFO L93 Difference]: Finished difference Result 366 states and 530 transitions. [2023-11-06 22:26:11,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:26:11,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-11-06 22:26:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:11,077 INFO L225 Difference]: With dead ends: 366 [2023-11-06 22:26:11,078 INFO L226 Difference]: Without dead ends: 216 [2023-11-06 22:26:11,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:26:11,081 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 388 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:11,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 580 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:26:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-06 22:26:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 151. [2023-11-06 22:26:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 129 states have internal predecessors, (180), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2023-11-06 22:26:11,106 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 167 [2023-11-06 22:26:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:11,107 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2023-11-06 22:26:11,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2023-11-06 22:26:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-06 22:26:11,110 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:11,110 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:11,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:26:11,111 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:11,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1389290381, now seen corresponding path program 1 times [2023-11-06 22:26:11,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349969867] [2023-11-06 22:26:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:11,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:13,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:13,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349969867] [2023-11-06 22:26:13,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349969867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:13,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:13,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 22:26:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012269651] [2023-11-06 22:26:13,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:13,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:26:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:13,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:26:13,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:26:13,626 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:14,754 INFO L93 Difference]: Finished difference Result 377 states and 547 transitions. [2023-11-06 22:26:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:26:14,755 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-11-06 22:26:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:14,757 INFO L225 Difference]: With dead ends: 377 [2023-11-06 22:26:14,757 INFO L226 Difference]: Without dead ends: 229 [2023-11-06 22:26:14,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:26:14,759 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 419 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:14,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 964 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:26:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-06 22:26:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 164. [2023-11-06 22:26:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 241 transitions. [2023-11-06 22:26:14,786 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 241 transitions. Word has length 167 [2023-11-06 22:26:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:14,787 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 241 transitions. [2023-11-06 22:26:14,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2023-11-06 22:26:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-06 22:26:14,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:14,790 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:14,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:26:14,791 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:14,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash 802484367, now seen corresponding path program 1 times [2023-11-06 22:26:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:14,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328608643] [2023-11-06 22:26:14,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:17,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328608643] [2023-11-06 22:26:17,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328608643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:17,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:17,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:26:17,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352498272] [2023-11-06 22:26:17,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:17,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:26:17,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:17,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:26:17,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:26:17,530 INFO L87 Difference]: Start difference. First operand 164 states and 241 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:18,419 INFO L93 Difference]: Finished difference Result 390 states and 567 transitions. [2023-11-06 22:26:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:26:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-11-06 22:26:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:18,423 INFO L225 Difference]: With dead ends: 390 [2023-11-06 22:26:18,424 INFO L226 Difference]: Without dead ends: 229 [2023-11-06 22:26:18,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:26:18,425 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 393 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:18,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 498 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:26:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-06 22:26:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 162. [2023-11-06 22:26:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2023-11-06 22:26:18,461 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 167 [2023-11-06 22:26:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:18,462 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2023-11-06 22:26:18,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2023-11-06 22:26:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-06 22:26:18,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:18,466 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:18,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:26:18,466 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:18,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:18,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2001026907, now seen corresponding path program 1 times [2023-11-06 22:26:18,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:18,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730871112] [2023-11-06 22:26:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:18,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730871112] [2023-11-06 22:26:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730871112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:21,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:21,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:26:21,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795480210] [2023-11-06 22:26:21,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:21,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:26:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:21,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:26:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:26:21,283 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:22,529 INFO L93 Difference]: Finished difference Result 359 states and 524 transitions. [2023-11-06 22:26:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:26:22,530 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-11-06 22:26:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:22,533 INFO L225 Difference]: With dead ends: 359 [2023-11-06 22:26:22,533 INFO L226 Difference]: Without dead ends: 200 [2023-11-06 22:26:22,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:26:22,534 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 268 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:22,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 630 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:26:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-06 22:26:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 164. [2023-11-06 22:26:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.408450704225352) internal successors, (200), 142 states have internal predecessors, (200), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 240 transitions. [2023-11-06 22:26:22,561 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 240 transitions. Word has length 167 [2023-11-06 22:26:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:22,562 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 240 transitions. [2023-11-06 22:26:22,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:22,562 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 240 transitions. [2023-11-06 22:26:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-06 22:26:22,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:22,565 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:22,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:26:22,566 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:22,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1414220893, now seen corresponding path program 1 times [2023-11-06 22:26:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:22,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954639008] [2023-11-06 22:26:22,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:24,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954639008] [2023-11-06 22:26:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954639008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:24,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:24,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:26:24,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517926040] [2023-11-06 22:26:24,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:24,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:26:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:24,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:26:24,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:26:24,815 INFO L87 Difference]: Start difference. First operand 164 states and 240 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:25,786 INFO L93 Difference]: Finished difference Result 361 states and 525 transitions. [2023-11-06 22:26:25,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:26:25,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-11-06 22:26:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:25,790 INFO L225 Difference]: With dead ends: 361 [2023-11-06 22:26:25,791 INFO L226 Difference]: Without dead ends: 200 [2023-11-06 22:26:25,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:26:25,793 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 349 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:25,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 919 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:26:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-06 22:26:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 162. [2023-11-06 22:26:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2023-11-06 22:26:25,829 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 167 [2023-11-06 22:26:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:25,830 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2023-11-06 22:26:25,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2023-11-06 22:26:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-06 22:26:25,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:25,834 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:25,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:26:25,835 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:25,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1451329995, now seen corresponding path program 1 times [2023-11-06 22:26:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:25,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396483052] [2023-11-06 22:26:25,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:27,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:27,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396483052] [2023-11-06 22:26:27,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396483052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:26:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434781723] [2023-11-06 22:26:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:27,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:26:27,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:27,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:26:27,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:27,088 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:27,533 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2023-11-06 22:26:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:26:27,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-11-06 22:26:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:27,537 INFO L225 Difference]: With dead ends: 322 [2023-11-06 22:26:27,537 INFO L226 Difference]: Without dead ends: 163 [2023-11-06 22:26:27,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:26:27,539 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 127 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:27,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 483 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:26:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-06 22:26:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2023-11-06 22:26:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 140 states have internal predecessors, (197), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2023-11-06 22:26:27,561 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 237 transitions. Word has length 167 [2023-11-06 22:26:27,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:27,562 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 237 transitions. [2023-11-06 22:26:27,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:27,562 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2023-11-06 22:26:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-06 22:26:27,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:27,565 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:27,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:26:27,565 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:27,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:27,566 INFO L85 PathProgramCache]: Analyzing trace with hash -354108339, now seen corresponding path program 1 times [2023-11-06 22:26:27,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:27,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779646705] [2023-11-06 22:26:27,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:27,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:29,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:29,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779646705] [2023-11-06 22:26:29,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779646705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:29,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:26:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610455171] [2023-11-06 22:26:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:29,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:26:29,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:29,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:26:29,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:26:29,977 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:30,766 INFO L93 Difference]: Finished difference Result 361 states and 524 transitions. [2023-11-06 22:26:30,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:26:30,767 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-11-06 22:26:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:30,769 INFO L225 Difference]: With dead ends: 361 [2023-11-06 22:26:30,770 INFO L226 Difference]: Without dead ends: 202 [2023-11-06 22:26:30,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:26:30,773 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 292 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:30,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 464 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:26:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-06 22:26:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 164. [2023-11-06 22:26:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.4014084507042253) internal successors, (199), 142 states have internal predecessors, (199), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 239 transitions. [2023-11-06 22:26:30,796 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 239 transitions. Word has length 167 [2023-11-06 22:26:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:30,801 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 239 transitions. [2023-11-06 22:26:30,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 239 transitions. [2023-11-06 22:26:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-06 22:26:30,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:30,806 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:30,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:26:30,806 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:30,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash -940914353, now seen corresponding path program 1 times [2023-11-06 22:26:30,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:30,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049518991] [2023-11-06 22:26:30,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:30,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:32,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:32,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049518991] [2023-11-06 22:26:32,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049518991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:32,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:32,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:26:32,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868208272] [2023-11-06 22:26:32,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:32,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:26:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:32,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:26:32,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:26:32,942 INFO L87 Difference]: Start difference. First operand 164 states and 239 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:34,088 INFO L93 Difference]: Finished difference Result 363 states and 525 transitions. [2023-11-06 22:26:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:26:34,089 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2023-11-06 22:26:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:34,092 INFO L225 Difference]: With dead ends: 363 [2023-11-06 22:26:34,092 INFO L226 Difference]: Without dead ends: 202 [2023-11-06 22:26:34,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:26:34,093 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 298 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:34,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1088 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:26:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-06 22:26:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2023-11-06 22:26:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 140 states have internal predecessors, (197), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 237 transitions. [2023-11-06 22:26:34,122 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 237 transitions. Word has length 167 [2023-11-06 22:26:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:34,123 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 237 transitions. [2023-11-06 22:26:34,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 237 transitions. [2023-11-06 22:26:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 22:26:34,126 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:34,127 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:34,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:26:34,127 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:34,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash 107651391, now seen corresponding path program 1 times [2023-11-06 22:26:34,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:34,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641305636] [2023-11-06 22:26:34,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:34,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-06 22:26:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641305636] [2023-11-06 22:26:35,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641305636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:35,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:35,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:26:35,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131173075] [2023-11-06 22:26:35,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:35,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:26:35,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:35,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:26:35,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:26:35,632 INFO L87 Difference]: Start difference. First operand 162 states and 237 transitions. Second operand has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:26:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:36,566 INFO L93 Difference]: Finished difference Result 407 states and 585 transitions. [2023-11-06 22:26:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:26:36,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2023-11-06 22:26:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:36,569 INFO L225 Difference]: With dead ends: 407 [2023-11-06 22:26:36,570 INFO L226 Difference]: Without dead ends: 248 [2023-11-06 22:26:36,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:26:36,571 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 314 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:36,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1057 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:26:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-06 22:26:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 166. [2023-11-06 22:26:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.3958333333333333) internal successors, (201), 144 states have internal predecessors, (201), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:26:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 241 transitions. [2023-11-06 22:26:36,600 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 241 transitions. Word has length 169 [2023-11-06 22:26:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:36,601 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 241 transitions. [2023-11-06 22:26:36,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 22:26:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 241 transitions. [2023-11-06 22:26:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 22:26:36,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:36,603 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:36,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:26:36,603 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:36,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash 530353217, now seen corresponding path program 1 times [2023-11-06 22:26:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:36,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041891662] [2023-11-06 22:26:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:36,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:26:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:26:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:26:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:26:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:26:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:26:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:26:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:26:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:26:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:26:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:26:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:26:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:26:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 22:26:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:26:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-06 22:26:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 22:26:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 22:26:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 22:26:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-06 22:26:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-06 22:26:36,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041891662] [2023-11-06 22:26:36,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041891662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:36,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:36,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:36,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695073431] [2023-11-06 22:26:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:36,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:36,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:36,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:36,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:26:36,741 INFO L87 Difference]: Start difference. First operand 166 states and 241 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:26:36,774 INFO L93 Difference]: Finished difference Result 333 states and 487 transitions. [2023-11-06 22:26:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:36,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 169 [2023-11-06 22:26:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:26:36,776 INFO L225 Difference]: With dead ends: 333 [2023-11-06 22:26:36,776 INFO L226 Difference]: Without dead ends: 170 [2023-11-06 22:26:36,777 INFO L412 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 [2023-11-06 22:26:36,778 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:26:36,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:26:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-06 22:26:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2023-11-06 22:26:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 148 states have (on average 1.385135135135135) internal successors, (205), 148 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) [2023-11-06 22:26:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2023-11-06 22:26:36,801 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 169 [2023-11-06 22:26:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:26:36,802 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2023-11-06 22:26:36,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-06 22:26:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2023-11-06 22:26:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 22:26:36,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:26:36,804 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:36,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:26:36,804 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:26:36,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash 749207935, now seen corresponding path program 1 times [2023-11-06 22:26:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:36,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211785308] [2023-11-06 22:26:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:36,849 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-06 22:26:36,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942875343] [2023-11-06 22:26:36,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:36,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:36,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:36,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:26:36,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:26:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:26:39,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:26:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:26:41,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:26:41,269 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:26:41,270 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:26:41,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:26:41,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:26:41,494 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:41,499 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:26:41,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:26:41 BoogieIcfgContainer [2023-11-06 22:26:41,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:26:41,813 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:26:41,813 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:26:41,813 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:26:41,814 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:25:44" (3/4) ... [2023-11-06 22:26:41,816 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:26:41,817 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:26:41,818 INFO L158 Benchmark]: Toolchain (without parser) took 58846.85ms. Allocated memory was 174.1MB in the beginning and 755.0MB in the end (delta: 580.9MB). Free memory was 145.1MB in the beginning and 282.8MB in the end (delta: -137.7MB). Peak memory consumption was 443.2MB. Max. memory is 16.1GB. [2023-11-06 22:26:41,819 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 121.6MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:26:41,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.15ms. Allocated memory is still 174.1MB. Free memory was 144.3MB in the beginning and 130.6MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:26:41,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.75ms. Allocated memory is still 174.1MB. Free memory was 130.6MB in the beginning and 126.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:26:41,820 INFO L158 Benchmark]: Boogie Preprocessor took 78.89ms. Allocated memory is still 174.1MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:26:41,820 INFO L158 Benchmark]: RCFGBuilder took 1065.49ms. Allocated memory is still 174.1MB. Free memory was 123.5MB in the beginning and 111.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:26:41,820 INFO L158 Benchmark]: TraceAbstraction took 57074.28ms. Allocated memory was 174.1MB in the beginning and 755.0MB in the end (delta: 580.9MB). Free memory was 110.3MB in the beginning and 283.8MB in the end (delta: -173.6MB). Peak memory consumption was 409.1MB. Max. memory is 16.1GB. [2023-11-06 22:26:41,821 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 755.0MB. Free memory was 283.8MB in the beginning and 282.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:26:41,828 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.28ms. Allocated memory is still 121.6MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.15ms. Allocated memory is still 174.1MB. Free memory was 144.3MB in the beginning and 130.6MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.75ms. Allocated memory is still 174.1MB. Free memory was 130.6MB in the beginning and 126.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.89ms. Allocated memory is still 174.1MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1065.49ms. Allocated memory is still 174.1MB. Free memory was 123.5MB in the beginning and 111.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 57074.28ms. Allocated memory was 174.1MB in the beginning and 755.0MB in the end (delta: 580.9MB). Free memory was 110.3MB in the beginning and 283.8MB in the end (delta: -173.6MB). Peak memory consumption was 409.1MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 755.0MB. Free memory was 283.8MB in the beginning and 282.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned long int var_1_2 = 16; [L25] unsigned long int* var_1_2_Pointer = &(var_1_2); [L26] unsigned long int var_1_3 = 64; [L27] unsigned long int* var_1_3_Pointer = &(var_1_3); [L28] unsigned long int var_1_4 = 25; [L29] unsigned long int* var_1_4_Pointer = &(var_1_4); [L30] float var_1_5 = 1.2; [L31] float* var_1_5_Pointer = &(var_1_5); [L32] float var_1_6 = 999.7; [L33] float* var_1_6_Pointer = &(var_1_6); [L34] float var_1_7 = 1.4; [L35] float* var_1_7_Pointer = &(var_1_7); [L36] float var_1_8 = 9.75; [L37] float* var_1_8_Pointer = &(var_1_8); [L38] float var_1_9 = 1.75; [L39] float* var_1_9_Pointer = &(var_1_9); [L40] unsigned long int var_1_10 = 16; [L41] unsigned long int* var_1_10_Pointer = &(var_1_10); [L42] unsigned long int var_1_11 = 1277342739; [L43] unsigned long int* var_1_11_Pointer = &(var_1_11); [L44] unsigned long int var_1_12 = 1394088949; [L45] unsigned long int* var_1_12_Pointer = &(var_1_12); [L46] unsigned long int var_1_13 = 0; [L47] unsigned long int* var_1_13_Pointer = &(var_1_13); [L48] unsigned char var_1_14 = 0; [L49] unsigned char* var_1_14_Pointer = &(var_1_14); [L50] unsigned char var_1_17 = 0; [L51] unsigned char* var_1_17_Pointer = &(var_1_17); [L52] unsigned char var_1_18 = 0; [L53] unsigned char* var_1_18_Pointer = &(var_1_18); [L54] unsigned char var_1_19 = 0; [L55] unsigned char* var_1_19_Pointer = &(var_1_19); VAL [isInitial=0, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] FCALL updateLastVariables() [L123] CALL updateVariables() [L79] var_1_2 = __VERIFIER_nondet_ulong() [L80] EXPR \read(var_1_2) VAL [\read(var_1_2)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L80] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L80] RET assume_abort_if_not(var_1_2 >= 0) VAL [\read(var_1_2)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L81] EXPR \read(var_1_2) VAL [\read(var_1_2)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L81] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L81] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [\read(var_1_2)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L82] var_1_3 = __VERIFIER_nondet_ulong() [L83] EXPR \read(var_1_3) VAL [\read(var_1_3)=5368709122, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L83] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L83] RET assume_abort_if_not(var_1_3 >= 0) VAL [\read(var_1_3)=5368709122, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L84] EXPR \read(var_1_3) VAL [\read(var_1_3)=5368709122, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L84] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L84] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [\read(var_1_3)=5368709122, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] var_1_5 = __VERIFIER_nondet_float() [L86] EXPR \read(var_1_5) [L86] EXPR var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F [L86] EXPR \read(var_1_5) [L86] EXPR var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F VAL [\read(var_1_5)=4, \read(var_1_5)=4, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] EXPR (var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) VAL [(var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )=1, \read(var_1_5)=4, \read(var_1_5)=4, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F=1, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [(var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )=1, \read(var_1_5)=4, \read(var_1_5)=4, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F=1, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] var_1_6 = __VERIFIER_nondet_float() [L88] EXPR \read(var_1_6) [L88] EXPR var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F [L88] EXPR \read(var_1_6) [L88] EXPR var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F VAL [\read(var_1_6)=5, \read(var_1_6)=5, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] EXPR (var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F ) VAL [(var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )=1, \read(var_1_6)=5, \read(var_1_6)=5, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F=1, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [(var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )=1, \read(var_1_6)=5, \read(var_1_6)=5, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F=1, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] EXPR \read(var_1_6) VAL [\read(var_1_6)=5, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] CALL assume_abort_if_not(var_1_6 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] RET assume_abort_if_not(var_1_6 != 0.0F) VAL [\read(var_1_6)=5, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] var_1_7 = __VERIFIER_nondet_float() [L91] EXPR \read(var_1_7) [L91] EXPR var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F [L91] EXPR \read(var_1_7) [L91] EXPR var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F VAL [\read(var_1_7)=6, \read(var_1_7)=6, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] EXPR (var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F ) VAL [(var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )=1, \read(var_1_7)=6, \read(var_1_7)=6, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F=1, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [(var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )=1, \read(var_1_7)=6, \read(var_1_7)=6, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F=1, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] var_1_8 = __VERIFIER_nondet_float() [L93] EXPR \read(var_1_8) [L93] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F [L93] EXPR \read(var_1_8) [L93] EXPR var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F VAL [\read(var_1_8)=7, \read(var_1_8)=7, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR (var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [(var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )=1, \read(var_1_8)=7, \read(var_1_8)=7, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F=1, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [(var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )=1, \read(var_1_8)=7, \read(var_1_8)=7, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F=1, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L94] var_1_9 = __VERIFIER_nondet_float() [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F [L95] EXPR \read(var_1_9) [L95] EXPR var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F VAL [\read(var_1_9)=8, \read(var_1_9)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] EXPR (var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [(var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )=1, \read(var_1_9)=8, \read(var_1_9)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F=1, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [(var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )=1, \read(var_1_9)=8, \read(var_1_9)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F=1, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] var_1_11 = __VERIFIER_nondet_ulong() [L97] EXPR \read(var_1_11) VAL [\read(var_1_11)=5368709119, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [\read(var_1_11)=5368709119, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] EXPR \read(var_1_11) VAL [\read(var_1_11)=5368709119, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [\read(var_1_11)=5368709119, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] var_1_12 = __VERIFIER_nondet_ulong() [L100] EXPR \read(var_1_12) VAL [\read(var_1_12)=5368709120, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L100] CALL assume_abort_if_not(var_1_12 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L100] RET assume_abort_if_not(var_1_12 >= 1073741824) VAL [\read(var_1_12)=5368709120, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR \read(var_1_12) VAL [\read(var_1_12)=5368709120, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [\read(var_1_12)=5368709120, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] var_1_13 = __VERIFIER_nondet_ulong() [L103] EXPR \read(var_1_13) VAL [\read(var_1_13)=-2147483649, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [\read(var_1_13)=-2147483649, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] EXPR \read(var_1_13) VAL [\read(var_1_13)=-2147483649, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [\read(var_1_13)=-2147483649, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] var_1_17 = __VERIFIER_nondet_uchar() [L106] EXPR \read(var_1_17) VAL [\read(var_1_17)=5368709121, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] RET assume_abort_if_not(var_1_17 >= 1) VAL [\read(var_1_17)=5368709121, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L107] EXPR \read(var_1_17) VAL [\read(var_1_17)=5368709121, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L107] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L107] RET assume_abort_if_not(var_1_17 <= 1) VAL [\read(var_1_17)=5368709121, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L108] var_1_19 = __VERIFIER_nondet_uchar() [L109] EXPR \read(var_1_19) VAL [\read(var_1_19)=-256, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] RET assume_abort_if_not(var_1_19 >= 0) VAL [\read(var_1_19)=-256, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] EXPR \read(var_1_19) VAL [\read(var_1_19)=-256, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] RET assume_abort_if_not(var_1_19 <= 0) VAL [\read(var_1_19)=-256, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L123] RET updateVariables() [L124] CALL step() [L59] EXPR \read(*var_1_2_Pointer) [L59] EXPR \read(*var_1_3_Pointer) VAL [\read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L59] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L59] EXPR \read(*var_1_2_Pointer) [L59] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [(((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L59] (*(var_1_1_Pointer)) = (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) [L60] EXPR \read(*var_1_5_Pointer) [L60] EXPR \read(*var_1_6_Pointer) [L60] EXPR \read(*var_1_7_Pointer) [L60] EXPR \read(*var_1_8_Pointer) [L60] EXPR \read(*var_1_9_Pointer) VAL [\read(*var_1_5_Pointer)=4, \read(*var_1_6_Pointer)=5, \read(*var_1_7_Pointer)=6, \read(*var_1_8_Pointer)=7, \read(*var_1_9_Pointer)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L60] COND FALSE !(((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) [L63] EXPR \read(*var_1_2_Pointer) [L63] EXPR \read(*var_1_11_Pointer) [L63] EXPR \read(*var_1_12_Pointer) [L63] EXPR \read(*var_1_13_Pointer) VAL [\read(*var_1_11_Pointer)=5368709119, \read(*var_1_12_Pointer)=5368709120, \read(*var_1_13_Pointer)=-2147483649, \read(*var_1_2_Pointer)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L63] EXPR (((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer)))) [L63] EXPR \read(*var_1_2_Pointer) [L63] EXPR (((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer)))) VAL [(((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))=1, \read(*var_1_11_Pointer)=5368709119, \read(*var_1_12_Pointer)=5368709120, \read(*var_1_13_Pointer)=-2147483649, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L63] (*(var_1_10_Pointer)) = (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer)))))) [L64] EXPR \read(*var_1_5_Pointer) [L64] unsigned char stepLocal_0 = (- (*(var_1_5_Pointer))) != 1.9f; [L65] stepLocal_0 || (((*(var_1_4_Pointer)) * (*(var_1_13_Pointer))) < (*(var_1_3_Pointer))) [L65] EXPR \read(*var_1_4_Pointer) [L65] EXPR \read(*var_1_13_Pointer) [L65] EXPR \read(*var_1_3_Pointer) [L65] stepLocal_0 || (((*(var_1_4_Pointer)) * (*(var_1_13_Pointer))) < (*(var_1_3_Pointer))) VAL [\read(*var_1_13_Pointer)=-2147483649, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_4_Pointer)=25, isInitial=1, stepLocal_0 || (((*(var_1_4_Pointer)) * (*(var_1_13_Pointer))) < (*(var_1_3_Pointer)))=0, stepLocal_0=0, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L65] COND FALSE !(stepLocal_0 || (((*(var_1_4_Pointer)) * (*(var_1_13_Pointer))) < (*(var_1_3_Pointer)))) [L68] EXPR \read(*var_1_19_Pointer) [L68] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L70] EXPR \read(*var_1_18_Pointer) VAL [\read(*var_1_18_Pointer)=-256, isInitial=1, stepLocal_0=0, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L70] COND FALSE !((*(var_1_18_Pointer))) [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR \read(*var_1_2_Pointer) [L115] EXPR \read(*var_1_3_Pointer) VAL [\read(*var_1_1_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L115] EXPR \read(*var_1_2_Pointer) [L115] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [(((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, \read(*var_1_1_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1) [L115] EXPR \read(*var_1_5_Pointer) [L115] EXPR \read(*var_1_6_Pointer) [L115] EXPR \read(*var_1_7_Pointer) [L115] EXPR \read(*var_1_8_Pointer) [L115] EXPR \read(*var_1_9_Pointer) VAL [(((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, ((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)=1, \read(*var_1_1_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_5_Pointer)=4, \read(*var_1_6_Pointer)=5, \read(*var_1_7_Pointer)=6, \read(*var_1_8_Pointer)=7, \read(*var_1_9_Pointer)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] EXPR (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1 [L115] EXPR \read(*var_1_4_Pointer) [L115] EXPR \read(*var_1_2_Pointer) [L115] EXPR \read(*var_1_3_Pointer) VAL [(((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, ((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)=1, \read(*var_1_1_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_4_Pointer)=25, \read(*var_1_5_Pointer)=4, \read(*var_1_6_Pointer)=5, \read(*var_1_7_Pointer)=6, \read(*var_1_8_Pointer)=7, \read(*var_1_9_Pointer)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L115] EXPR \read(*var_1_2_Pointer) [L115] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [(((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, ((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)=1, \read(*var_1_1_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_4_Pointer)=25, \read(*var_1_5_Pointer)=4, \read(*var_1_6_Pointer)=5, \read(*var_1_7_Pointer)=6, \read(*var_1_8_Pointer)=7, \read(*var_1_9_Pointer)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] EXPR (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1 VAL [(((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1=0, ((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)=1, \read(*var_1_1_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_4_Pointer)=25, \read(*var_1_5_Pointer)=4, \read(*var_1_6_Pointer)=5, \read(*var_1_7_Pointer)=6, \read(*var_1_8_Pointer)=7, \read(*var_1_9_Pointer)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] EXPR ((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1) VAL [(((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1=0, ((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)=0, \read(*var_1_1_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_4_Pointer)=25, \read(*var_1_5_Pointer)=4, \read(*var_1_6_Pointer)=5, \read(*var_1_7_Pointer)=6, \read(*var_1_8_Pointer)=7, \read(*var_1_9_Pointer)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] EXPR (((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((*(var_1_10_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer)))))))) VAL [(((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((*(var_1_10_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))))))=0, (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1=0, ((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)=0, \read(*var_1_1_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_4_Pointer)=25, \read(*var_1_5_Pointer)=4, \read(*var_1_6_Pointer)=5, \read(*var_1_7_Pointer)=6, \read(*var_1_8_Pointer)=7, \read(*var_1_9_Pointer)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] EXPR ((((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((*(var_1_10_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))))))) && ((*(var_1_18_Pointer)) ? ((! (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) < ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_18_Pointer)) ? ((*(var_1_14_Pointer)) == ((unsigned char) (! (*(var_1_17_Pointer))))) : 1) : 1) : 1) VAL [((((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((*(var_1_10_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))))))) && ((*(var_1_18_Pointer)) ? ((! (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) < ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_18_Pointer)) ? ((*(var_1_14_Pointer)) == ((unsigned char) (! (*(var_1_17_Pointer))))) : 1) : 1) : 1)=0, (((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((*(var_1_10_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))))))=0, (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1=0, ((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)=0, \read(*var_1_1_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_4_Pointer)=25, \read(*var_1_5_Pointer)=4, \read(*var_1_6_Pointer)=5, \read(*var_1_7_Pointer)=6, \read(*var_1_8_Pointer)=7, \read(*var_1_9_Pointer)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] EXPR (((((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((*(var_1_10_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))))))) && ((*(var_1_18_Pointer)) ? ((! (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) < ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_18_Pointer)) ? ((*(var_1_14_Pointer)) == ((unsigned char) (! (*(var_1_17_Pointer))))) : 1) : 1) : 1)) && ((((- (*(var_1_5_Pointer))) != 1.9f) || (((*(var_1_4_Pointer)) * (*(var_1_13_Pointer))) < (*(var_1_3_Pointer)))) ? ((*(var_1_18_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer))))) VAL [(((((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((*(var_1_10_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))))))) && ((*(var_1_18_Pointer)) ? ((! (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) < ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_18_Pointer)) ? ((*(var_1_14_Pointer)) == ((unsigned char) (! (*(var_1_17_Pointer))))) : 1) : 1) : 1)) && ((((- (*(var_1_5_Pointer))) != 1.9f) || (((*(var_1_4_Pointer)) * (*(var_1_13_Pointer))) < (*(var_1_3_Pointer)))) ? ((*(var_1_18_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))=0, ((((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((*(var_1_10_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))))))) && ((*(var_1_18_Pointer)) ? ((! (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) < ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_18_Pointer)) ? ((*(var_1_14_Pointer)) == ((unsigned char) (! (*(var_1_17_Pointer))))) : 1) : 1) : 1)=0, (((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((*(var_1_10_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))))))=0, (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer)))=1, (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1=0, ((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)=0, \read(*var_1_1_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_2_Pointer)=1, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_3_Pointer)=5368709122, \read(*var_1_4_Pointer)=25, \read(*var_1_5_Pointer)=4, \read(*var_1_6_Pointer)=5, \read(*var_1_7_Pointer)=6, \read(*var_1_8_Pointer)=7, \read(*var_1_9_Pointer)=8, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115-L116] return (((((*(var_1_1_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) && ((((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) <= ((*(var_1_7_Pointer)) + ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_4_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))))) : 1)) && ((*(var_1_10_Pointer)) == ((unsigned long int) (((((*(var_1_2_Pointer))) > ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) ? ((*(var_1_2_Pointer))) : ((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))))))) && ((*(var_1_18_Pointer)) ? ((! (((*(var_1_5_Pointer)) / (*(var_1_6_Pointer))) < ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer))))) ? ((*(var_1_18_Pointer)) ? ((*(var_1_14_Pointer)) == ((unsigned char) (! (*(var_1_17_Pointer))))) : 1) : 1) : 1)) && ((((- (*(var_1_5_Pointer))) != 1.9f) || (((*(var_1_4_Pointer)) * (*(var_1_13_Pointer))) < (*(var_1_3_Pointer)))) ? ((*(var_1_18_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_18_Pointer)) == ((unsigned char) (*(var_1_19_Pointer))))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_17={18:0}, var_1_17_Pointer={18:0}, var_1_18={19:0}, var_1_18_Pointer={19:0}, var_1_19={20:0}, var_1_19_Pointer={20:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.7s, OverallIterations: 19, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4779 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4778 mSDsluCounter, 12425 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9387 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7830 IncrementalHoareTripleChecker+Invalid, 7944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 3038 mSDtfsCounter, 7830 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 989 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=18, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 693 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 12.5s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 3167 NumberOfCodeBlocks, 3167 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2980 ConstructedInterpolants, 0 QuantifiedInterpolants, 32705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 13680/13680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:26:41,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 d1b834b0c672fe89129f134ed175bc47986b842eb441fdde200e666204d40818 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:26:44,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:26:44,817 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:26:44,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:26:44,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:26:44,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:26:44,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:26:44,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:26:44,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:26:44,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:26:44,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:26:44,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:26:44,882 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:26:44,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:26:44,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:26:44,886 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:26:44,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:26:44,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:26:44,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:26:44,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:26:44,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:26:44,889 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:26:44,890 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:26:44,890 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:26:44,891 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:26:44,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:26:44,892 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:26:44,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:26:44,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:26:44,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:26:44,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:26:44,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:26:44,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:26:44,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:26:44,896 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:26:44,897 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:26:44,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:26:44,897 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:26:44,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:26:44,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:26:44,899 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:26:44,900 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:26:44,900 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> d1b834b0c672fe89129f134ed175bc47986b842eb441fdde200e666204d40818 [2023-11-06 22:26:45,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:26:45,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:26:45,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:26:45,437 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:26:45,438 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:26:45,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i [2023-11-06 22:26:48,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:26:49,110 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:26:49,112 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i [2023-11-06 22:26:49,126 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/data/8d52a00c7/f27d444ec97a4cb58f1b3f8eff2cf504/FLAG1465c88a8 [2023-11-06 22:26:49,143 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/data/8d52a00c7/f27d444ec97a4cb58f1b3f8eff2cf504 [2023-11-06 22:26:49,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:26:49,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:26:49,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:26:49,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:26:49,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:26:49,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302c3ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49, skipping insertion in model container [2023-11-06 22:26:49,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,197 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:26:49,405 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i[916,929] [2023-11-06 22:26:49,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:26:49,511 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:26:49,536 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i[916,929] [2023-11-06 22:26:49,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:26:49,642 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:26:49,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49 WrapperNode [2023-11-06 22:26:49,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:26:49,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:26:49,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:26:49,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:26:49,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,767 INFO L138 Inliner]: procedures = 33, calls = 194, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 531 [2023-11-06 22:26:49,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:26:49,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:26:49,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:26:49,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:26:49,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:26:49,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:26:49,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:26:49,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:26:49,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (1/1) ... [2023-11-06 22:26:49,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:26:49,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:49,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:26:49,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:26:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:26:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:26:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:26:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:26:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:26:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:26:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:26:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:26:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:26:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:26:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:26:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:26:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:26:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:26:50,187 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:26:50,189 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:27:05,603 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:27:05,612 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:27:05,627 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:27:05,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:05 BoogieIcfgContainer [2023-11-06 22:27:05,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:27:05,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:27:05,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:27:05,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:27:05,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:26:49" (1/3) ... [2023-11-06 22:27:05,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e1485a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:05, skipping insertion in model container [2023-11-06 22:27:05,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:49" (2/3) ... [2023-11-06 22:27:05,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e1485a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:27:05, skipping insertion in model container [2023-11-06 22:27:05,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:27:05" (3/3) ... [2023-11-06 22:27:05,639 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-23.i [2023-11-06 22:27:05,660 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:27:05,662 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:27:05,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:27:05,762 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1a25de55, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:27:05,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:27:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:27:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-06 22:27:05,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:27:05,794 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:27:05,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:27:05,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:27:05,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1279411170, now seen corresponding path program 1 times [2023-11-06 22:27:05,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:27:05,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665669267] [2023-11-06 22:27:05,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:27:05,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:05,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:27:05,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:27:05,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:27:06,301 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Exception during sending of exit command (exit): Broken pipe [2023-11-06 22:27:06,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 139 [2023-11-06 22:27:06,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:27:06,502 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 22:27:06,509 INFO L158 Benchmark]: Toolchain (without parser) took 17356.31ms. Allocated memory is still 77.6MB. Free memory was 53.2MB in the beginning and 50.3MB in the end (delta: 2.9MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2023-11-06 22:27:06,510 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 56.6MB. Free memory is still 32.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:27:06,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.25ms. Allocated memory is still 77.6MB. Free memory was 53.0MB in the beginning and 38.1MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:27:06,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.20ms. Allocated memory is still 77.6MB. Free memory was 38.1MB in the beginning and 54.0MB in the end (delta: -15.9MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2023-11-06 22:27:06,512 INFO L158 Benchmark]: Boogie Preprocessor took 105.23ms. Allocated memory is still 77.6MB. Free memory was 54.0MB in the beginning and 50.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:27:06,513 INFO L158 Benchmark]: RCFGBuilder took 15754.52ms. Allocated memory is still 77.6MB. Free memory was 50.8MB in the beginning and 32.5MB in the end (delta: 18.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2023-11-06 22:27:06,523 INFO L158 Benchmark]: TraceAbstraction took 874.61ms. Allocated memory is still 77.6MB. Free memory was 31.8MB in the beginning and 50.3MB in the end (delta: -18.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2023-11-06 22:27:06,527 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.37ms. Allocated memory is still 56.6MB. Free memory is still 32.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.25ms. Allocated memory is still 77.6MB. Free memory was 53.0MB in the beginning and 38.1MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.20ms. Allocated memory is still 77.6MB. Free memory was 38.1MB in the beginning and 54.0MB in the end (delta: -15.9MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.23ms. Allocated memory is still 77.6MB. Free memory was 54.0MB in the beginning and 50.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 15754.52ms. Allocated memory is still 77.6MB. Free memory was 50.8MB in the beginning and 32.5MB in the end (delta: 18.3MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 874.61ms. Allocated memory is still 77.6MB. Free memory was 31.8MB in the beginning and 50.3MB in the end (delta: -18.5MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:27:06,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d87619f-73c2-41df-ac9f-321ca5d93577/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.