./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.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_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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_911541b8-1676-4739-8fc5-fd1080e1f313/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 a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:31:32,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:31:32,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:31:32,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:31:32,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:31:32,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:31:32,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:31:32,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:31:32,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:31:32,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:31:32,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:31:32,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:31:32,595 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:31:32,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:31:32,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:31:32,598 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:31:32,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:31:32,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:31:32,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:31:32,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:31:32,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:31:32,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:31:32,600 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:31:32,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:31:32,603 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:31:32,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:31:32,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:31:32,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:31:32,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:31:32,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:31:32,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:31:32,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:31:32,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:31:32,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:31:32,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:31:32,608 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:31:32,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:31:32,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:31:32,608 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:31:32,609 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_911541b8-1676-4739-8fc5-fd1080e1f313/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_911541b8-1676-4739-8fc5-fd1080e1f313/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 -> a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 [2023-11-06 22:31:32,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:31:32,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:31:32,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:31:32,988 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:31:32,988 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:31:32,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2023-11-06 22:31:36,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:31:36,377 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:31:36,377 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2023-11-06 22:31:36,388 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/data/e9300f763/c237d0cf68ff45609aa48670447cbdab/FLAG1e0ab1dd2 [2023-11-06 22:31:36,403 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/data/e9300f763/c237d0cf68ff45609aa48670447cbdab [2023-11-06 22:31:36,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:31:36,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:31:36,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:31:36,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:31:36,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:31:36,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f409fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36, skipping insertion in model container [2023-11-06 22:31:36,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,451 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:31:36,634 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_911541b8-1676-4739-8fc5-fd1080e1f313/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i[917,930] [2023-11-06 22:31:36,712 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:31:36,726 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:31:36,739 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_911541b8-1676-4739-8fc5-fd1080e1f313/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i[917,930] [2023-11-06 22:31:36,779 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:31:36,801 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:31:36,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36 WrapperNode [2023-11-06 22:31:36,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:31:36,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:31:36,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:31:36,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:31:36,812 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:31:36" (1/1) ... [2023-11-06 22:31:36,827 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:31:36" (1/1) ... [2023-11-06 22:31:36,882 INFO L138 Inliner]: procedures = 29, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2023-11-06 22:31:36,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:31:36,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:31:36,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:31:36,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:31:36,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:31:36,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:31:36,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:31:36,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:31:36,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36" (1/1) ... [2023-11-06 22:31:36,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:31:36,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:37,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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:31:37,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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:31:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:31:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:31:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:31:37,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:31:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:31:37,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:31:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:31:37,080 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:31:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:31:37,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:31:37,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:31:37,261 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:31:37,265 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:31:37,864 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:31:37,884 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:31:37,886 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:31:37,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:37 BoogieIcfgContainer [2023-11-06 22:31:37,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:31:37,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:31:37,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:31:37,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:31:37,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:31:36" (1/3) ... [2023-11-06 22:31:37,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed9a990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:37, skipping insertion in model container [2023-11-06 22:31:37,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:36" (2/3) ... [2023-11-06 22:31:37,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed9a990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:37, skipping insertion in model container [2023-11-06 22:31:37,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:37" (3/3) ... [2023-11-06 22:31:37,905 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-54.i [2023-11-06 22:31:37,928 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:31:37,928 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:31:38,013 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:31:38,022 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;@4a13ee0a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:31:38,023 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:31:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:31:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-06 22:31:38,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:38,053 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,054 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:38,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:38,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1606318882, now seen corresponding path program 1 times [2023-11-06 22:31:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:38,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126711290] [2023-11-06 22:31:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:38,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:38,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126711290] [2023-11-06 22:31:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126711290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:31:38,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705468389] [2023-11-06 22:31:38,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:38,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:31:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:38,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:31:38,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:31:38,640 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:31:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:38,709 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2023-11-06 22:31:38,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:31:38,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2023-11-06 22:31:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:38,725 INFO L225 Difference]: With dead ends: 213 [2023-11-06 22:31:38,725 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:31:38,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:31:38,736 INFO L413 NwaCegarLoop]: 155 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, 155 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:31:38,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:31:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:31:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-06 22:31:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:31:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2023-11-06 22:31:38,822 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 105 [2023-11-06 22:31:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:38,823 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2023-11-06 22:31:38,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:31:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2023-11-06 22:31:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-06 22:31:38,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:38,836 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:38,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:31:38,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:38,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1914200370, now seen corresponding path program 1 times [2023-11-06 22:31:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981533969] [2023-11-06 22:31:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:39,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981533969] [2023-11-06 22:31:39,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981533969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:39,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:39,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515438669] [2023-11-06 22:31:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:39,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:39,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:39,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:39,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:39,375 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:39,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:39,435 INFO L93 Difference]: Finished difference Result 240 states and 354 transitions. [2023-11-06 22:31:39,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:31:39,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2023-11-06 22:31:39,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:39,438 INFO L225 Difference]: With dead ends: 240 [2023-11-06 22:31:39,438 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 22:31:39,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:31:39,441 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 76 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:39,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 488 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:31:39,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 22:31:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2023-11-06 22:31:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:31:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2023-11-06 22:31:39,457 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 105 [2023-11-06 22:31:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:39,460 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2023-11-06 22:31:39,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2023-11-06 22:31:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:31:39,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:39,463 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:39,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:31:39,463 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:39,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -314773303, now seen corresponding path program 1 times [2023-11-06 22:31:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:39,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249559102] [2023-11-06 22:31:39,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:39,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:39,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:39,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249559102] [2023-11-06 22:31:39,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249559102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:39,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:39,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:39,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882481914] [2023-11-06 22:31:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:39,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:39,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:39,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:39,674 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:39,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:39,713 INFO L93 Difference]: Finished difference Result 221 states and 322 transitions. [2023-11-06 22:31:39,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:31:39,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2023-11-06 22:31:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:39,716 INFO L225 Difference]: With dead ends: 221 [2023-11-06 22:31:39,716 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:31:39,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:31:39,719 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 12 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:39,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 449 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:31:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:31:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2023-11-06 22:31:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.40625) internal successors, (135), 96 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:31:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2023-11-06 22:31:39,736 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 107 [2023-11-06 22:31:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:39,737 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2023-11-06 22:31:39,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2023-11-06 22:31:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:31:39,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:39,743 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:39,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:31:39,761 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:39,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:39,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1460234059, now seen corresponding path program 1 times [2023-11-06 22:31:39,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:39,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717120370] [2023-11-06 22:31:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:40,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:40,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717120370] [2023-11-06 22:31:40,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717120370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:40,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:40,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930973385] [2023-11-06 22:31:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:40,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:40,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:40,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:40,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:40,026 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:40,072 INFO L93 Difference]: Finished difference Result 221 states and 320 transitions. [2023-11-06 22:31:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:31:40,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2023-11-06 22:31:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:40,084 INFO L225 Difference]: With dead ends: 221 [2023-11-06 22:31:40,085 INFO L226 Difference]: Without dead ends: 114 [2023-11-06 22:31:40,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:31:40,090 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 3 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:40,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 449 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:31:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-06 22:31:40,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2023-11-06 22:31:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:31:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2023-11-06 22:31:40,110 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 107 [2023-11-06 22:31:40,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:40,111 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2023-11-06 22:31:40,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2023-11-06 22:31:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 22:31:40,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:40,113 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:40,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:31:40,115 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:40,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:40,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1462081101, now seen corresponding path program 1 times [2023-11-06 22:31:40,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:40,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013523680] [2023-11-06 22:31:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:40,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:40,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:40,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013523680] [2023-11-06 22:31:40,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013523680] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:40,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:40,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:31:40,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349486403] [2023-11-06 22:31:40,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:40,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:31:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:31:40,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:31:40,848 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:31:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:41,304 INFO L93 Difference]: Finished difference Result 317 states and 458 transitions. [2023-11-06 22:31:41,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:31:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2023-11-06 22:31:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:41,307 INFO L225 Difference]: With dead ends: 317 [2023-11-06 22:31:41,308 INFO L226 Difference]: Without dead ends: 208 [2023-11-06 22:31:41,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:31:41,310 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 468 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:41,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 392 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:31:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-06 22:31:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 127. [2023-11-06 22:31:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.424778761061947) internal successors, (161), 113 states have internal predecessors, (161), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:31:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2023-11-06 22:31:41,328 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 107 [2023-11-06 22:31:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:41,329 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2023-11-06 22:31:41,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:31:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2023-11-06 22:31:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-06 22:31:41,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:41,332 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:41,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:31:41,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:41,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash 544621908, now seen corresponding path program 1 times [2023-11-06 22:31:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:41,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251073845] [2023-11-06 22:31:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:41,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:42,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:42,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251073845] [2023-11-06 22:31:42,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251073845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:42,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:42,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:31:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351200089] [2023-11-06 22:31:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:42,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:31:42,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:42,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:31:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:31:42,695 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:31:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:42,921 INFO L93 Difference]: Finished difference Result 314 states and 461 transitions. [2023-11-06 22:31:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:31:42,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2023-11-06 22:31:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:42,924 INFO L225 Difference]: With dead ends: 314 [2023-11-06 22:31:42,925 INFO L226 Difference]: Without dead ends: 190 [2023-11-06 22:31:42,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:31:42,926 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 139 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:42,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 339 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:31:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-11-06 22:31:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2023-11-06 22:31:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 148 states have (on average 1.3918918918918919) internal successors, (206), 148 states have internal predecessors, (206), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:31:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 254 transitions. [2023-11-06 22:31:42,955 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 254 transitions. Word has length 108 [2023-11-06 22:31:42,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:42,956 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 254 transitions. [2023-11-06 22:31:42,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:31:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 254 transitions. [2023-11-06 22:31:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-06 22:31:42,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:42,958 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:31:42,959 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:42,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:42,959 INFO L85 PathProgramCache]: Analyzing trace with hash -273026542, now seen corresponding path program 1 times [2023-11-06 22:31:42,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870222165] [2023-11-06 22:31:42,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:44,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:44,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870222165] [2023-11-06 22:31:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870222165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:44,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:44,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:31:44,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662774486] [2023-11-06 22:31:44,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:44,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:31:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:31:44,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:31:44,982 INFO L87 Difference]: Start difference. First operand 175 states and 254 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:31:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:45,577 INFO L93 Difference]: Finished difference Result 404 states and 587 transitions. [2023-11-06 22:31:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:31:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2023-11-06 22:31:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:45,581 INFO L225 Difference]: With dead ends: 404 [2023-11-06 22:31:45,581 INFO L226 Difference]: Without dead ends: 280 [2023-11-06 22:31:45,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:31:45,585 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 247 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:45,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 594 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:31:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-06 22:31:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 222. [2023-11-06 22:31:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 195 states have (on average 1.4) internal successors, (273), 195 states have internal predecessors, (273), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:31:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 321 transitions. [2023-11-06 22:31:45,633 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 321 transitions. Word has length 108 [2023-11-06 22:31:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:45,634 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 321 transitions. [2023-11-06 22:31:45,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:31:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 321 transitions. [2023-11-06 22:31:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-06 22:31:45,637 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:45,637 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:45,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:31:45,638 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:45,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash -859832556, now seen corresponding path program 1 times [2023-11-06 22:31:45,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:45,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885036669] [2023-11-06 22:31:45,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:47,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:47,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885036669] [2023-11-06 22:31:47,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885036669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:47,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:47,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:31:47,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307745926] [2023-11-06 22:31:47,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:47,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:31:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:47,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:31:47,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:31:47,803 INFO L87 Difference]: Start difference. First operand 222 states and 321 transitions. Second operand has 12 states, 10 states have (on average 5.1) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-06 22:31:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:48,736 INFO L93 Difference]: Finished difference Result 577 states and 826 transitions. [2023-11-06 22:31:48,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:31:48,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 108 [2023-11-06 22:31:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:48,740 INFO L225 Difference]: With dead ends: 577 [2023-11-06 22:31:48,740 INFO L226 Difference]: Without dead ends: 358 [2023-11-06 22:31:48,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:31:48,743 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 788 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:48,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 632 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:31:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-11-06 22:31:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 246. [2023-11-06 22:31:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 219 states have (on average 1.3835616438356164) internal successors, (303), 219 states have internal predecessors, (303), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:31:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 351 transitions. [2023-11-06 22:31:48,797 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 351 transitions. Word has length 108 [2023-11-06 22:31:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:48,798 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 351 transitions. [2023-11-06 22:31:48,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-06 22:31:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 351 transitions. [2023-11-06 22:31:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:31:48,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:48,801 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:48,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:31:48,801 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:48,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1112397672, now seen corresponding path program 1 times [2023-11-06 22:31:48,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:48,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026851877] [2023-11-06 22:31:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:48,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:50,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:50,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026851877] [2023-11-06 22:31:50,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026851877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:50,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:50,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:31:50,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105522045] [2023-11-06 22:31:50,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:50,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:31:50,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:50,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:31:50,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:31:50,182 INFO L87 Difference]: Start difference. First operand 246 states and 351 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:31:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:51,601 INFO L93 Difference]: Finished difference Result 586 states and 842 transitions. [2023-11-06 22:31:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:31:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2023-11-06 22:31:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:51,606 INFO L225 Difference]: With dead ends: 586 [2023-11-06 22:31:51,606 INFO L226 Difference]: Without dead ends: 447 [2023-11-06 22:31:51,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:31:51,608 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 560 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:51,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1527 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:31:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-11-06 22:31:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 268. [2023-11-06 22:31:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 241 states have (on average 1.4024896265560165) internal successors, (338), 241 states have internal predecessors, (338), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:31:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 386 transitions. [2023-11-06 22:31:51,657 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 386 transitions. Word has length 109 [2023-11-06 22:31:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:51,657 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 386 transitions. [2023-11-06 22:31:51,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:31:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 386 transitions. [2023-11-06 22:31:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:31:51,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:51,659 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:51,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:31:51,659 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:51,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash 101280422, now seen corresponding path program 1 times [2023-11-06 22:31:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:51,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888124670] [2023-11-06 22:31:51,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:51,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:52,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:52,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888124670] [2023-11-06 22:31:52,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888124670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:52,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:52,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:31:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912691437] [2023-11-06 22:31:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:52,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:31:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:31:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:31:52,397 INFO L87 Difference]: Start difference. First operand 268 states and 386 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:53,053 INFO L93 Difference]: Finished difference Result 570 states and 820 transitions. [2023-11-06 22:31:53,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:31:53,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2023-11-06 22:31:53,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:53,057 INFO L225 Difference]: With dead ends: 570 [2023-11-06 22:31:53,058 INFO L226 Difference]: Without dead ends: 409 [2023-11-06 22:31:53,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:31:53,059 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 276 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:53,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 957 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:31:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-11-06 22:31:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 268. [2023-11-06 22:31:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 241 states have internal predecessors, (336), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:31:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 384 transitions. [2023-11-06 22:31:53,115 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 384 transitions. Word has length 109 [2023-11-06 22:31:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:53,116 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 384 transitions. [2023-11-06 22:31:53,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 384 transitions. [2023-11-06 22:31:53,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:31:53,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:53,120 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:53,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:31:53,120 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:53,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash 978384166, now seen corresponding path program 1 times [2023-11-06 22:31:53,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:53,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204796388] [2023-11-06 22:31:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:53,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:53,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:53,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204796388] [2023-11-06 22:31:53,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204796388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:53,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:53,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:31:53,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783555192] [2023-11-06 22:31:53,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:53,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:31:53,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:53,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:31:53,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:31:53,825 INFO L87 Difference]: Start difference. First operand 268 states and 384 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:54,417 INFO L93 Difference]: Finished difference Result 589 states and 847 transitions. [2023-11-06 22:31:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:31:54,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2023-11-06 22:31:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:54,421 INFO L225 Difference]: With dead ends: 589 [2023-11-06 22:31:54,421 INFO L226 Difference]: Without dead ends: 428 [2023-11-06 22:31:54,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:31:54,423 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 435 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:54,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 745 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:31:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-11-06 22:31:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 283. [2023-11-06 22:31:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 256 states have (on average 1.40234375) internal successors, (359), 256 states have internal predecessors, (359), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:31:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 407 transitions. [2023-11-06 22:31:54,474 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 407 transitions. Word has length 109 [2023-11-06 22:31:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:54,475 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 407 transitions. [2023-11-06 22:31:54,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 407 transitions. [2023-11-06 22:31:54,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:31:54,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:54,477 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:54,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:31:54,478 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:54,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:54,478 INFO L85 PathProgramCache]: Analyzing trace with hash -32733084, now seen corresponding path program 1 times [2023-11-06 22:31:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721373221] [2023-11-06 22:31:54,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721373221] [2023-11-06 22:31:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721373221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:55,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:55,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:31:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680329585] [2023-11-06 22:31:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:55,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:31:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:55,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:31:55,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:31:55,103 INFO L87 Difference]: Start difference. First operand 283 states and 407 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:31:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:55,911 INFO L93 Difference]: Finished difference Result 600 states and 862 transitions. [2023-11-06 22:31:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:31:55,911 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2023-11-06 22:31:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:55,915 INFO L225 Difference]: With dead ends: 600 [2023-11-06 22:31:55,915 INFO L226 Difference]: Without dead ends: 424 [2023-11-06 22:31:55,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:31:55,917 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 554 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:55,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1065 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:31:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-11-06 22:31:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 283. [2023-11-06 22:31:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 256 states have (on average 1.40234375) internal successors, (359), 256 states have internal predecessors, (359), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:31:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 407 transitions. [2023-11-06 22:31:55,982 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 407 transitions. Word has length 109 [2023-11-06 22:31:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:55,983 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 407 transitions. [2023-11-06 22:31:55,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:31:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 407 transitions. [2023-11-06 22:31:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:31:55,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:55,986 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:55,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:31:55,987 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:55,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:55,987 INFO L85 PathProgramCache]: Analyzing trace with hash -846099282, now seen corresponding path program 1 times [2023-11-06 22:31:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:55,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941189386] [2023-11-06 22:31:55,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:55,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941189386] [2023-11-06 22:31:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941189386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:57,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:31:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016374037] [2023-11-06 22:31:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:57,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:31:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:57,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:31:57,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:31:57,331 INFO L87 Difference]: Start difference. First operand 283 states and 407 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:31:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:57,638 INFO L93 Difference]: Finished difference Result 532 states and 774 transitions. [2023-11-06 22:31:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:31:57,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2023-11-06 22:31:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:57,643 INFO L225 Difference]: With dead ends: 532 [2023-11-06 22:31:57,643 INFO L226 Difference]: Without dead ends: 356 [2023-11-06 22:31:57,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:31:57,646 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 95 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:57,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 433 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:31:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-11-06 22:31:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 337. [2023-11-06 22:31:57,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.3905723905723906) internal successors, (413), 297 states have internal predecessors, (413), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:31:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 485 transitions. [2023-11-06 22:31:57,736 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 485 transitions. Word has length 109 [2023-11-06 22:31:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:57,736 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 485 transitions. [2023-11-06 22:31:57,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-06 22:31:57,737 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 485 transitions. [2023-11-06 22:31:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:31:57,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:57,739 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:57,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:31:57,739 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:57,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1759924272, now seen corresponding path program 1 times [2023-11-06 22:31:57,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:57,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591381206] [2023-11-06 22:31:57,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:57,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:58,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:58,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591381206] [2023-11-06 22:31:58,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591381206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:58,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:58,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:31:58,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575709238] [2023-11-06 22:31:58,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:58,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:31:58,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:58,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:31:58,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:31:58,451 INFO L87 Difference]: Start difference. First operand 337 states and 485 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:59,026 INFO L93 Difference]: Finished difference Result 676 states and 974 transitions. [2023-11-06 22:31:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:31:59,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2023-11-06 22:31:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:59,034 INFO L225 Difference]: With dead ends: 676 [2023-11-06 22:31:59,034 INFO L226 Difference]: Without dead ends: 500 [2023-11-06 22:31:59,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:31:59,036 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 294 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:59,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 652 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:31:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2023-11-06 22:31:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 335. [2023-11-06 22:31:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 295 states have (on average 1.3796610169491526) internal successors, (407), 295 states have internal predecessors, (407), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:31:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 479 transitions. [2023-11-06 22:31:59,104 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 479 transitions. Word has length 109 [2023-11-06 22:31:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:59,105 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 479 transitions. [2023-11-06 22:31:59,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 22:31:59,105 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 479 transitions. [2023-11-06 22:31:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-06 22:31:59,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:59,108 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:59,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:31:59,108 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:31:59,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:59,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1438926694, now seen corresponding path program 1 times [2023-11-06 22:31:59,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:59,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575694149] [2023-11-06 22:31:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:59,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:31:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:31:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:31:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:31:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:31:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:31:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:31:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:31:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:31:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:31:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:31:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:31:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:31:59,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:59,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575694149] [2023-11-06 22:31:59,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575694149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:59,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:59,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:31:59,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167440843] [2023-11-06 22:31:59,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:59,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:31:59,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:59,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:31:59,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:31:59,914 INFO L87 Difference]: Start difference. First operand 335 states and 479 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:32:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:32:00,861 INFO L93 Difference]: Finished difference Result 586 states and 849 transitions. [2023-11-06 22:32:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:32:00,862 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-11-06 22:32:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:32:00,866 INFO L225 Difference]: With dead ends: 586 [2023-11-06 22:32:00,866 INFO L226 Difference]: Without dead ends: 584 [2023-11-06 22:32:00,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:32:00,870 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 469 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:32:00,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 772 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:32:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2023-11-06 22:32:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 393. [2023-11-06 22:32:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 353 states have (on average 1.388101983002833) internal successors, (490), 353 states have internal predecessors, (490), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:32:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 562 transitions. [2023-11-06 22:32:00,961 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 562 transitions. Word has length 110 [2023-11-06 22:32:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:32:00,963 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 562 transitions. [2023-11-06 22:32:00,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:32:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 562 transitions. [2023-11-06 22:32:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-06 22:32:00,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:32:00,966 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:00,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:32:00,966 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:32:00,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:00,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1440773736, now seen corresponding path program 1 times [2023-11-06 22:32:00,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:00,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222817185] [2023-11-06 22:32:00,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:00,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:32:01,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:32:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:32:01,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:32:01,296 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:32:01,298 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:32:01,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:32:01,304 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:01,309 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:32:01,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:32:01 BoogieIcfgContainer [2023-11-06 22:32:01,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:32:01,471 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:32:01,471 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:32:01,471 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:32:01,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:37" (3/4) ... [2023-11-06 22:32:01,475 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:32:01,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:32:01,477 INFO L158 Benchmark]: Toolchain (without parser) took 25069.34ms. Allocated memory was 134.2MB in the beginning and 425.7MB in the end (delta: 291.5MB). Free memory was 89.0MB in the beginning and 201.7MB in the end (delta: -112.7MB). Peak memory consumption was 180.3MB. Max. memory is 16.1GB. [2023-11-06 22:32:01,477 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 134.2MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:32:01,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.64ms. Allocated memory is still 134.2MB. Free memory was 88.5MB in the beginning and 73.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:32:01,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.71ms. Allocated memory is still 134.2MB. Free memory was 73.8MB in the beginning and 70.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:32:01,480 INFO L158 Benchmark]: Boogie Preprocessor took 56.31ms. Allocated memory is still 134.2MB. Free memory was 70.2MB in the beginning and 67.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:32:01,480 INFO L158 Benchmark]: RCFGBuilder took 949.60ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 67.6MB in the beginning and 122.2MB in the end (delta: -54.6MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2023-11-06 22:32:01,481 INFO L158 Benchmark]: TraceAbstraction took 23577.09ms. Allocated memory was 163.6MB in the beginning and 425.7MB in the end (delta: 262.1MB). Free memory was 121.0MB in the beginning and 201.7MB in the end (delta: -80.7MB). Peak memory consumption was 181.3MB. Max. memory is 16.1GB. [2023-11-06 22:32:01,482 INFO L158 Benchmark]: Witness Printer took 5.63ms. Allocated memory is still 425.7MB. Free memory is still 201.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:32:01,489 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.33ms. Allocated memory is still 134.2MB. Free memory is still 107.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.64ms. Allocated memory is still 134.2MB. Free memory was 88.5MB in the beginning and 73.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.71ms. Allocated memory is still 134.2MB. Free memory was 73.8MB in the beginning and 70.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.31ms. Allocated memory is still 134.2MB. Free memory was 70.2MB in the beginning and 67.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 949.60ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 67.6MB in the beginning and 122.2MB in the end (delta: -54.6MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23577.09ms. Allocated memory was 163.6MB in the beginning and 425.7MB in the end (delta: 262.1MB). Free memory was 121.0MB in the beginning and 201.7MB in the end (delta: -80.7MB). Peak memory consumption was 181.3MB. Max. memory is 16.1GB. * Witness Printer took 5.63ms. Allocated memory is still 425.7MB. Free memory is still 201.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryFLOATComparisonOperation at line 121. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L51] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L53] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L54] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L55] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L58] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L59] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L60] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L61] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L62] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L98] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_3=254, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00.var_1_3=254, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_3=254, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00.var_1_3=254, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L101] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=257, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00.var_1_6=257, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=257, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00.var_1_6=257, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=256, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00.var_1_9=256, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=256, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00.var_1_9=256, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L107] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=-255, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00.var_1_10=-255, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=-255, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00.var_1_10=-255, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L110] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00.var_1_12=261, WrapperStruct00.var_1_12=261, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )=1, WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F=1, WrapperStruct00.var_1_12=261, WrapperStruct00.var_1_12=261, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )=1, WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F=1, WrapperStruct00.var_1_12=261, WrapperStruct00.var_1_12=261, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00.var_1_13=266, WrapperStruct00.var_1_13=266, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )=1, WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F=1, WrapperStruct00.var_1_13=266, WrapperStruct00.var_1_13=266, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )=1, WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F=1, WrapperStruct00.var_1_13=266, WrapperStruct00.var_1_13=266, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L114] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=-3, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00.var_1_16=-3, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=-3, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, cond=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00.var_1_16=-3, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L129] RET updateVariables() [L130] CALL step() [L66] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L66] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L67] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L67] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L68] signed long int stepLocal_0 = -4; [L69] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_15_Pointer)=-3, isInitial=1, stepLocal_0=-4] [L69] COND FALSE !(stepLocal_0 >= (*(WrapperStruct00_var_1_15_Pointer))) [L72] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L72] unsigned char stepLocal_2 = (*(WrapperStruct00_var_1_3_Pointer)); [L73] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_9_Pointer)=256, isInitial=1, stepLocal_0=-4, stepLocal_2=254] [L73] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_1_Pointer)=16, isInitial=1, stepLocal_0=-4, stepLocal_2=254] [L82] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L82] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))=16, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, isInitial=1, stepLocal_0=-4, stepLocal_2=254] [L82] signed long int stepLocal_1 = (((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))); [L83] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_1_Pointer)=16, isInitial=1, stepLocal_0=-4, stepLocal_1=16, stepLocal_2=254] [L83] COND FALSE !((8 * (*(WrapperStruct00_var_1_1_Pointer))) == stepLocal_1) [L94] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L94] (*(WrapperStruct00_var_1_4_Pointer)) = (*(WrapperStruct00_var_1_10_Pointer)) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_15_Pointer)=-3, isInitial=1] [L121] EXPR (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [(-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_15_Pointer)=-3, isInitial=1] [L121] EXPR ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))=1, (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_15_Pointer)=-3, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, isInitial=1] [L121] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))=1, ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))=16, (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_15_Pointer)=-3, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, isInitial=1] [L121] EXPR ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L121] EXPR ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))) VAL [((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))=1, ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))=16, ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))=1, (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_10_Pointer)=-255, \read(*WrapperStruct00_var_1_15_Pointer)=-3, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_4_Pointer)=-255, isInitial=1] [L121] EXPR ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) VAL [((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))=1, ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))=16, ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))=1, (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_10_Pointer)=-255, \read(*WrapperStruct00_var_1_15_Pointer)=-3, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_4_Pointer)=-255, isInitial=1] [L121] EXPR (((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [(((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)=1, ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))=1, ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))=16, ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))=1, (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_10_Pointer)=-255, \read(*WrapperStruct00_var_1_15_Pointer)=-3, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_4_Pointer)=-255, \read(*WrapperStruct00_var_1_9_Pointer)=256, isInitial=1] [L121] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1 VAL [(((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)=1, ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))=1, ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))=16, ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))=1, (*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1=1, (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_10_Pointer)=-255, \read(*WrapperStruct00_var_1_15_Pointer)=-3, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_4_Pointer)=-255, \read(*WrapperStruct00_var_1_9_Pointer)=256, isInitial=1] [L121] EXPR (((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1) VAL [(((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)=1, ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))=1, ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))=16, ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))=1, (*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1=1, (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_10_Pointer)=-255, \read(*WrapperStruct00_var_1_15_Pointer)=-3, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_4_Pointer)=-255, \read(*WrapperStruct00_var_1_9_Pointer)=256, isInitial=1] [L121] EXPR ((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR ((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [(((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)=1, ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))=1, ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))=16, ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))=1, (*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1=1, (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_10_Pointer)=-255, \read(*WrapperStruct00_var_1_12_Pointer)=261, \read(*WrapperStruct00_var_1_14_Pointer)=261, \read(*WrapperStruct00_var_1_15_Pointer)=-3, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_4_Pointer)=-255, \read(*WrapperStruct00_var_1_9_Pointer)=256, isInitial=1] [L121] EXPR (((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [(((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))=0, ((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))=0, (((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)=1, ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))=1, ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))=16, ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))=1, (*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1=1, (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \read(*WrapperStruct00_var_1_10_Pointer)=-255, \read(*WrapperStruct00_var_1_12_Pointer)=261, \read(*WrapperStruct00_var_1_14_Pointer)=261, \read(*WrapperStruct00_var_1_15_Pointer)=-3, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_1_Pointer)=16, \read(*WrapperStruct00_var_1_4_Pointer)=-255, \read(*WrapperStruct00_var_1_9_Pointer)=256, isInitial=1] [L121-L122] return (((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 16, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4418 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4416 mSDsluCounter, 9649 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7273 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4731 IncrementalHoareTripleChecker+Invalid, 4922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 2376 mSDtfsCounter, 4731 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 564 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=15, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 1284 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 1729 NumberOfCodeBlocks, 1729 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1604 ConstructedInterpolants, 0 QuantifiedInterpolants, 11789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 3960/3960 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:32:01,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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_911541b8-1676-4739-8fc5-fd1080e1f313/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 a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:32:04,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:32:04,449 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:32:04,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:32:04,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:32:04,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:32:04,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:32:04,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:32:04,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:32:04,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:32:04,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:32:04,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:32:04,519 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:32:04,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:32:04,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:32:04,522 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:32:04,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:32:04,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:32:04,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:32:04,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:32:04,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:32:04,527 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:32:04,527 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:32:04,528 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:32:04,528 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:32:04,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:32:04,529 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:32:04,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:32:04,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:32:04,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:32:04,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:32:04,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:32:04,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:32:04,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:32:04,535 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:32:04,535 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:32:04,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:32:04,536 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:32:04,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:32:04,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:32:04,538 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:32:04,538 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:32:04,538 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_911541b8-1676-4739-8fc5-fd1080e1f313/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_911541b8-1676-4739-8fc5-fd1080e1f313/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 -> a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 [2023-11-06 22:32:05,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:32:05,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:32:05,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:32:05,048 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:32:05,049 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:32:05,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2023-11-06 22:32:08,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:32:08,649 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:32:08,650 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2023-11-06 22:32:08,660 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/data/6890af97c/3d3656c432314ac5ae4ca1b9d6505f7d/FLAG9d56a873c [2023-11-06 22:32:08,675 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/data/6890af97c/3d3656c432314ac5ae4ca1b9d6505f7d [2023-11-06 22:32:08,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:32:08,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:32:08,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:32:08,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:32:08,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:32:08,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:32:08" (1/1) ... [2023-11-06 22:32:08,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bb65b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:08, skipping insertion in model container [2023-11-06 22:32:08,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:32:08" (1/1) ... [2023-11-06 22:32:08,723 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:32:08,922 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_911541b8-1676-4739-8fc5-fd1080e1f313/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i[917,930] [2023-11-06 22:32:09,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:32:09,079 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:32:09,102 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_911541b8-1676-4739-8fc5-fd1080e1f313/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i[917,930] [2023-11-06 22:32:09,176 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:32:09,225 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:32:09,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09 WrapperNode [2023-11-06 22:32:09,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:32:09,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:32:09,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:32:09,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:32:09,235 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:32:09" (1/1) ... [2023-11-06 22:32:09,272 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:32:09" (1/1) ... [2023-11-06 22:32:09,333 INFO L138 Inliner]: procedures = 33, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 417 [2023-11-06 22:32:09,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:32:09,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:32:09,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:32:09,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:32:09,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09" (1/1) ... [2023-11-06 22:32:09,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09" (1/1) ... [2023-11-06 22:32:09,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09" (1/1) ... [2023-11-06 22:32:09,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09" (1/1) ... [2023-11-06 22:32:09,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09" (1/1) ... [2023-11-06 22:32:09,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09" (1/1) ... [2023-11-06 22:32:09,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09" (1/1) ... [2023-11-06 22:32:09,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09" (1/1) ... [2023-11-06 22:32:09,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:32:09,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:32:09,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:32:09,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:32:09,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09" (1/1) ... [2023-11-06 22:32:09,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:32:09,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:32:09,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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:32:09,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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:32:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:32:09,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 22:32:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 22:32:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:32:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:32:09,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:32:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 22:32:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:32:09,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:32:09,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:32:09,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:32:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:32:09,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:32:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:32:09,742 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:32:09,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:32:11,425 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:32:11,433 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:32:11,433 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:32:11,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:32:11 BoogieIcfgContainer [2023-11-06 22:32:11,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:32:11,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:32:11,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:32:11,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:32:11,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:32:08" (1/3) ... [2023-11-06 22:32:11,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518bde68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:32:11, skipping insertion in model container [2023-11-06 22:32:11,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:09" (2/3) ... [2023-11-06 22:32:11,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518bde68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:32:11, skipping insertion in model container [2023-11-06 22:32:11,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:32:11" (3/3) ... [2023-11-06 22:32:11,449 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-54.i [2023-11-06 22:32:11,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:32:11,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:32:11,552 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:32:11,561 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;@5f43ab58, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:32:11,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:32:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:32:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-06 22:32:11,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:32:11,592 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:11,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:32:11,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1606318882, now seen corresponding path program 1 times [2023-11-06 22:32:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:11,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975068633] [2023-11-06 22:32:11,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:11,620 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:32:11,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:11,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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:32:11,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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:32:12,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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:32:12,011 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_911541b8-1676-4739-8fc5-fd1080e1f313/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_911541b8-1676-4739-8fc5-fd1080e1f313/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:32:12,016 INFO L158 Benchmark]: Toolchain (without parser) took 3335.27ms. Allocated memory is still 75.5MB. Free memory was 51.1MB in the beginning and 30.5MB in the end (delta: 20.6MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-11-06 22:32:12,017 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 54.5MB. Free memory was 30.2MB in the beginning and 30.1MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:32:12,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.74ms. Allocated memory is still 75.5MB. Free memory was 50.9MB in the beginning and 53.6MB in the end (delta: -2.7MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2023-11-06 22:32:12,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.40ms. Allocated memory is still 75.5MB. Free memory was 53.6MB in the beginning and 50.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:32:12,019 INFO L158 Benchmark]: Boogie Preprocessor took 78.40ms. Allocated memory is still 75.5MB. Free memory was 50.6MB in the beginning and 47.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:32:12,019 INFO L158 Benchmark]: RCFGBuilder took 2015.21ms. Allocated memory is still 75.5MB. Free memory was 47.2MB in the beginning and 32.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-11-06 22:32:12,020 INFO L158 Benchmark]: TraceAbstraction took 575.92ms. Allocated memory is still 75.5MB. Free memory was 32.2MB in the beginning and 30.5MB in the end (delta: 1.8MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2023-11-06 22:32:12,025 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.36ms. Allocated memory is still 54.5MB. Free memory was 30.2MB in the beginning and 30.1MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.74ms. Allocated memory is still 75.5MB. Free memory was 50.9MB in the beginning and 53.6MB in the end (delta: -2.7MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.40ms. Allocated memory is still 75.5MB. Free memory was 53.6MB in the beginning and 50.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.40ms. Allocated memory is still 75.5MB. Free memory was 50.6MB in the beginning and 47.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2015.21ms. Allocated memory is still 75.5MB. Free memory was 47.2MB in the beginning and 32.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 575.92ms. Allocated memory is still 75.5MB. Free memory was 32.2MB in the beginning and 30.5MB in the end (delta: 1.8MB). Peak memory consumption was 1.1MB. 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_911541b8-1676-4739-8fc5-fd1080e1f313/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_911541b8-1676-4739-8fc5-fd1080e1f313/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:32:12,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911541b8-1676-4739-8fc5-fd1080e1f313/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_911541b8-1676-4739-8fc5-fd1080e1f313/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.