./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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 952f1621c7899c5ce964b8bd35a2296981cb24cd167b0d1d0e9f7406c8d49f3b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:04:56,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:04:56,151 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:04:56,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:04:56,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:04:56,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:04:56,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:04:56,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:04:56,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:04:56,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:04:56,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:04:56,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:04:56,200 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:04:56,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:04:56,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:04:56,204 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:04:56,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:04:56,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:04:56,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:04:56,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:04:56,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:04:56,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:04:56,212 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:04:56,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:04:56,213 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:04:56,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:04:56,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:04:56,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:04:56,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:04:56,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:04:56,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:04:56,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:04:56,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:04:56,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:04:56,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:04:56,219 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:04:56,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:04:56,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:04:56,220 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:04:56,220 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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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 -> 952f1621c7899c5ce964b8bd35a2296981cb24cd167b0d1d0e9f7406c8d49f3b [2023-11-06 22:04:56,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:04:56,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:04:56,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:04:56,495 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:04:56,496 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:04:56,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i [2023-11-06 22:04:59,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:04:59,911 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:04:59,915 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i [2023-11-06 22:04:59,930 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/data/01f72f97c/f19d35a5340f491e8c1994692989fcff/FLAG86283517b [2023-11-06 22:04:59,943 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/data/01f72f97c/f19d35a5340f491e8c1994692989fcff [2023-11-06 22:04:59,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:04:59,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:04:59,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:04:59,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:04:59,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:04:59,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:59" (1/1) ... [2023-11-06 22:04:59,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f95f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:59, skipping insertion in model container [2023-11-06 22:04:59,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:59" (1/1) ... [2023-11-06 22:05:00,012 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:05:00,167 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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i[916,929] [2023-11-06 22:05:00,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:05:00,247 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:05:00,257 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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i[916,929] [2023-11-06 22:05:00,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:05:00,339 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:05:00,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00 WrapperNode [2023-11-06 22:05:00,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:05:00,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:05:00,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:05:00,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:05:00,348 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:05:00" (1/1) ... [2023-11-06 22:05:00,362 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:05:00" (1/1) ... [2023-11-06 22:05:00,421 INFO L138 Inliner]: procedures = 29, calls = 203, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2023-11-06 22:05:00,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:05:00,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:05:00,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:05:00,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:05:00,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:05:00,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:05:00,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:05:00,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:05:00,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:05:00,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:05:00,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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:05:00,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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:05:00,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:05:00,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:05:00,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:05:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:05:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:05:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:05:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:05:00,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:05:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:05:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:05:00,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:05:00,777 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:05:00,779 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:05:01,444 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:05:01,452 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:05:01,452 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:05:01,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:01 BoogieIcfgContainer [2023-11-06 22:05:01,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:05:01,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:05:01,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:05:01,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:05:01,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:04:59" (1/3) ... [2023-11-06 22:05:01,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401a9ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:05:01, skipping insertion in model container [2023-11-06 22:05:01,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (2/3) ... [2023-11-06 22:05:01,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401a9ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:05:01, skipping insertion in model container [2023-11-06 22:05:01,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:01" (3/3) ... [2023-11-06 22:05:01,463 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-61.i [2023-11-06 22:05:01,482 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:05:01,482 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:05:01,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:05:01,537 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;@5d26e5d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:05:01,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:05:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:01,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:01,561 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:01,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:01,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:01,567 INFO L85 PathProgramCache]: Analyzing trace with hash 686700268, now seen corresponding path program 1 times [2023-11-06 22:05:01,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:01,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262575920] [2023-11-06 22:05:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:01,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:02,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262575920] [2023-11-06 22:05:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262575920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:02,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:02,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:05:02,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193997910] [2023-11-06 22:05:02,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:02,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:05:02,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:02,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:05:02,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:05:02,390 INFO L87 Difference]: Start difference. First operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 22:05:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:02,430 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2023-11-06 22:05:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:05:02,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2023-11-06 22:05:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:02,442 INFO L225 Difference]: With dead ends: 233 [2023-11-06 22:05:02,442 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:05:02,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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:05:02,450 INFO L413 NwaCegarLoop]: 168 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, 168 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:05:02,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:05:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:05:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-11-06 22:05:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2023-11-06 22:05:02,506 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 190 [2023-11-06 22:05:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:02,506 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2023-11-06 22:05:02,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 22:05:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2023-11-06 22:05:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:02,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:02,515 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:02,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:05:02,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:02,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:02,517 INFO L85 PathProgramCache]: Analyzing trace with hash 326820314, now seen corresponding path program 1 times [2023-11-06 22:05:02,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:02,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299066428] [2023-11-06 22:05:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:03,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:03,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299066428] [2023-11-06 22:05:03,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299066428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:03,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:05:03,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91253427] [2023-11-06 22:05:03,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:03,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:03,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:03,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:03,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:03,220 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:03,331 INFO L93 Difference]: Finished difference Result 237 states and 344 transitions. [2023-11-06 22:05:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:05:03,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:03,339 INFO L225 Difference]: With dead ends: 237 [2023-11-06 22:05:03,340 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:05:03,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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:05:03,344 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 12 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:03,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 489 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:05:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:05:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2023-11-06 22:05:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2023-11-06 22:05:03,373 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 190 [2023-11-06 22:05:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:03,378 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2023-11-06 22:05:03,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2023-11-06 22:05:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:03,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:03,390 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:03,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:05:03,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:03,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2101827676, now seen corresponding path program 1 times [2023-11-06 22:05:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:03,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307083070] [2023-11-06 22:05:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:03,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:03,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:03,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307083070] [2023-11-06 22:05:03,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307083070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:03,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:03,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:05:03,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633942424] [2023-11-06 22:05:03,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:03,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:03,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:03,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:03,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:03,869 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:03,938 INFO L93 Difference]: Finished difference Result 237 states and 342 transitions. [2023-11-06 22:05:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:05:03,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:03,943 INFO L225 Difference]: With dead ends: 237 [2023-11-06 22:05:03,945 INFO L226 Difference]: Without dead ends: 122 [2023-11-06 22:05:03,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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:05:03,949 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 3 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 488 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:05:03,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 488 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:05:03,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-06 22:05:03,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2023-11-06 22:05:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2023-11-06 22:05:03,976 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 190 [2023-11-06 22:05:03,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:03,978 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2023-11-06 22:05:03,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2023-11-06 22:05:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:03,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:03,982 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:03,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:05:03,982 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:03,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:03,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2103674718, now seen corresponding path program 1 times [2023-11-06 22:05:03,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:03,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883821422] [2023-11-06 22:05:03,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:03,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:04,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:04,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883821422] [2023-11-06 22:05:04,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883821422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:04,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:04,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:05:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136441484] [2023-11-06 22:05:04,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:04,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:04,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:04,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:04,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:04,532 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:04,578 INFO L93 Difference]: Finished difference Result 248 states and 358 transitions. [2023-11-06 22:05:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:05:04,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:04,585 INFO L225 Difference]: With dead ends: 248 [2023-11-06 22:05:04,585 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 22:05:04,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:04,595 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 14 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:04,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 490 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:05:04,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 22:05:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2023-11-06 22:05:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2023-11-06 22:05:04,621 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 190 [2023-11-06 22:05:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:04,622 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2023-11-06 22:05:04,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2023-11-06 22:05:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:04,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:04,628 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:04,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:05:04,629 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:04,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash 180446684, now seen corresponding path program 1 times [2023-11-06 22:05:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:04,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580206720] [2023-11-06 22:05:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:04,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:06,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:06,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580206720] [2023-11-06 22:05:06,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580206720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:06,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:06,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:05:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508943971] [2023-11-06 22:05:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:06,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:05:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:06,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:05:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:05:06,788 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:07,255 INFO L93 Difference]: Finished difference Result 248 states and 354 transitions. [2023-11-06 22:05:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:05:07,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:07,261 INFO L225 Difference]: With dead ends: 248 [2023-11-06 22:05:07,261 INFO L226 Difference]: Without dead ends: 129 [2023-11-06 22:05:07,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:05:07,262 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 122 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:07,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 419 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:05:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-06 22:05:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2023-11-06 22:05:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2023-11-06 22:05:07,288 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 190 [2023-11-06 22:05:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:07,289 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2023-11-06 22:05:07,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2023-11-06 22:05:07,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:07,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:07,294 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:07,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:05:07,294 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:07,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash -805089184, now seen corresponding path program 1 times [2023-11-06 22:05:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:07,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485682023] [2023-11-06 22:05:07,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:07,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:09,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:10,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:10,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485682023] [2023-11-06 22:05:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485682023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:10,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:10,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:05:10,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683289558] [2023-11-06 22:05:10,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:10,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:05:10,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:05:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:05:10,018 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:11,050 INFO L93 Difference]: Finished difference Result 295 states and 420 transitions. [2023-11-06 22:05:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:05:11,053 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:11,055 INFO L225 Difference]: With dead ends: 295 [2023-11-06 22:05:11,055 INFO L226 Difference]: Without dead ends: 174 [2023-11-06 22:05:11,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:05:11,057 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 178 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:11,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 487 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:05:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-06 22:05:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 135. [2023-11-06 22:05:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2023-11-06 22:05:11,100 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 190 [2023-11-06 22:05:11,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:11,101 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2023-11-06 22:05:11,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2023-11-06 22:05:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:11,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:11,104 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:11,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:05:11,105 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:11,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:11,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1495733406, now seen corresponding path program 1 times [2023-11-06 22:05:11,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:11,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736673258] [2023-11-06 22:05:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:11,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:13,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:13,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:13,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:13,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:14,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736673258] [2023-11-06 22:05:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736673258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:14,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:05:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967970775] [2023-11-06 22:05:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:14,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:05:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:05:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:05:14,098 INFO L87 Difference]: Start difference. First operand 135 states and 193 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:15,388 INFO L93 Difference]: Finished difference Result 380 states and 540 transitions. [2023-11-06 22:05:15,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:05:15,389 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:15,394 INFO L225 Difference]: With dead ends: 380 [2023-11-06 22:05:15,395 INFO L226 Difference]: Without dead ends: 248 [2023-11-06 22:05:15,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:05:15,397 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 416 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:15,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 816 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:05:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-06 22:05:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 144. [2023-11-06 22:05:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 117 states have internal predecessors, (155), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 205 transitions. [2023-11-06 22:05:15,435 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 205 transitions. Word has length 190 [2023-11-06 22:05:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:15,436 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 205 transitions. [2023-11-06 22:05:15,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 205 transitions. [2023-11-06 22:05:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:15,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:15,439 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:15,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:05:15,440 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:15,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:15,440 INFO L85 PathProgramCache]: Analyzing trace with hash -904232631, now seen corresponding path program 1 times [2023-11-06 22:05:15,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:15,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707108731] [2023-11-06 22:05:15,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:15,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:17,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:17,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:17,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707108731] [2023-11-06 22:05:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707108731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:17,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:17,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:05:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453000043] [2023-11-06 22:05:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:17,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:05:17,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:17,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:05:17,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:05:17,037 INFO L87 Difference]: Start difference. First operand 144 states and 205 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:17,457 INFO L93 Difference]: Finished difference Result 360 states and 513 transitions. [2023-11-06 22:05:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:05:17,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:17,461 INFO L225 Difference]: With dead ends: 360 [2023-11-06 22:05:17,461 INFO L226 Difference]: Without dead ends: 219 [2023-11-06 22:05:17,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:05:17,463 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 295 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:17,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 665 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:05:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-06 22:05:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 151. [2023-11-06 22:05:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 216 transitions. [2023-11-06 22:05:17,489 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 216 transitions. Word has length 190 [2023-11-06 22:05:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:17,489 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 216 transitions. [2023-11-06 22:05:17,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 216 transitions. [2023-11-06 22:05:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:17,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:17,494 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:17,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:05:17,495 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:17,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:17,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1396589959, now seen corresponding path program 1 times [2023-11-06 22:05:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:17,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930789392] [2023-11-06 22:05:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:17,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:20,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:20,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930789392] [2023-11-06 22:05:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930789392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:20,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:20,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:05:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141530279] [2023-11-06 22:05:20,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:20,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:05:20,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:05:20,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:05:20,535 INFO L87 Difference]: Start difference. First operand 151 states and 216 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:22,135 INFO L93 Difference]: Finished difference Result 418 states and 593 transitions. [2023-11-06 22:05:22,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:05:22,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:22,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:22,142 INFO L225 Difference]: With dead ends: 418 [2023-11-06 22:05:22,142 INFO L226 Difference]: Without dead ends: 270 [2023-11-06 22:05:22,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:05:22,145 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 415 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:22,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 965 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-06 22:05:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-11-06 22:05:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 157. [2023-11-06 22:05:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 226 transitions. [2023-11-06 22:05:22,178 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 226 transitions. Word has length 190 [2023-11-06 22:05:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:22,179 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 226 transitions. [2023-11-06 22:05:22,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 226 transitions. [2023-11-06 22:05:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:22,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:22,183 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:22,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:05:22,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:22,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:22,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1227791010, now seen corresponding path program 1 times [2023-11-06 22:05:22,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:22,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591041244] [2023-11-06 22:05:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:22,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:24,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:24,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591041244] [2023-11-06 22:05:24,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591041244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:24,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:24,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:05:24,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74487650] [2023-11-06 22:05:24,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:24,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:05:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:24,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:05:24,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:05:24,630 INFO L87 Difference]: Start difference. First operand 157 states and 226 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:25,495 INFO L93 Difference]: Finished difference Result 356 states and 510 transitions. [2023-11-06 22:05:25,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:05:25,496 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:25,500 INFO L225 Difference]: With dead ends: 356 [2023-11-06 22:05:25,500 INFO L226 Difference]: Without dead ends: 202 [2023-11-06 22:05:25,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:05:25,502 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 422 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:25,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 441 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:05:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-06 22:05:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 157. [2023-11-06 22:05:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:25,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 226 transitions. [2023-11-06 22:05:25,538 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 226 transitions. Word has length 190 [2023-11-06 22:05:25,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:25,539 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 226 transitions. [2023-11-06 22:05:25,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 226 transitions. [2023-11-06 22:05:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:25,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:25,544 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:25,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:05:25,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:25,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:25,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1073031580, now seen corresponding path program 1 times [2023-11-06 22:05:25,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:25,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8849788] [2023-11-06 22:05:25,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:25,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:28,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:28,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8849788] [2023-11-06 22:05:28,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8849788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:28,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:28,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:05:28,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949546554] [2023-11-06 22:05:28,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:28,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:05:28,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:28,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:05:28,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:05:28,399 INFO L87 Difference]: Start difference. First operand 157 states and 226 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:29,597 INFO L93 Difference]: Finished difference Result 430 states and 611 transitions. [2023-11-06 22:05:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:05:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:29,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:29,600 INFO L225 Difference]: With dead ends: 430 [2023-11-06 22:05:29,600 INFO L226 Difference]: Without dead ends: 276 [2023-11-06 22:05:29,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:05:29,602 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 604 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:29,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 740 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:05:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-06 22:05:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 159. [2023-11-06 22:05:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.356060606060606) internal successors, (179), 132 states have internal predecessors, (179), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 229 transitions. [2023-11-06 22:05:29,628 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 229 transitions. Word has length 190 [2023-11-06 22:05:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:29,629 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 229 transitions. [2023-11-06 22:05:29,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 229 transitions. [2023-11-06 22:05:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:29,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:29,632 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:29,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:05:29,632 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:29,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1326934457, now seen corresponding path program 1 times [2023-11-06 22:05:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612799481] [2023-11-06 22:05:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:31,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:31,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612799481] [2023-11-06 22:05:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612799481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:31,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:31,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:05:31,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990586739] [2023-11-06 22:05:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:31,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:05:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:31,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:05:31,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:05:31,437 INFO L87 Difference]: Start difference. First operand 159 states and 229 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:31,929 INFO L93 Difference]: Finished difference Result 394 states and 564 transitions. [2023-11-06 22:05:31,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:05:31,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:31,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:31,932 INFO L225 Difference]: With dead ends: 394 [2023-11-06 22:05:31,932 INFO L226 Difference]: Without dead ends: 238 [2023-11-06 22:05:31,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:05:31,934 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 240 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:31,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 719 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:05:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-11-06 22:05:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 159. [2023-11-06 22:05:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.356060606060606) internal successors, (179), 132 states have internal predecessors, (179), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 229 transitions. [2023-11-06 22:05:31,961 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 229 transitions. Word has length 190 [2023-11-06 22:05:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:31,965 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 229 transitions. [2023-11-06 22:05:31,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 229 transitions. [2023-11-06 22:05:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:31,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:31,969 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:31,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:05:31,969 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:31,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash 973888133, now seen corresponding path program 1 times [2023-11-06 22:05:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:31,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990845823] [2023-11-06 22:05:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:34,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:35,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:35,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990845823] [2023-11-06 22:05:35,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990845823] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:35,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:35,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 22:05:35,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722195313] [2023-11-06 22:05:35,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:35,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:05:35,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:35,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:05:35,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:05:35,132 INFO L87 Difference]: Start difference. First operand 159 states and 229 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:37,324 INFO L93 Difference]: Finished difference Result 502 states and 710 transitions. [2023-11-06 22:05:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:05:37,325 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:37,328 INFO L225 Difference]: With dead ends: 502 [2023-11-06 22:05:37,328 INFO L226 Difference]: Without dead ends: 346 [2023-11-06 22:05:37,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:05:37,330 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 722 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:37,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 939 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-06 22:05:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-06 22:05:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 160. [2023-11-06 22:05:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 133 states have internal predecessors, (181), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 231 transitions. [2023-11-06 22:05:37,359 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 231 transitions. Word has length 190 [2023-11-06 22:05:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:37,360 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 231 transitions. [2023-11-06 22:05:37,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 231 transitions. [2023-11-06 22:05:37,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:37,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:37,363 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:37,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:05:37,363 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:37,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1361719900, now seen corresponding path program 1 times [2023-11-06 22:05:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:37,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941956037] [2023-11-06 22:05:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:40,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:40,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:40,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941956037] [2023-11-06 22:05:40,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941956037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:40,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:40,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:05:40,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209500942] [2023-11-06 22:05:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:40,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:05:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:40,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:05:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:05:40,046 INFO L87 Difference]: Start difference. First operand 160 states and 231 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:41,387 INFO L93 Difference]: Finished difference Result 392 states and 561 transitions. [2023-11-06 22:05:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:05:41,388 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:41,390 INFO L225 Difference]: With dead ends: 392 [2023-11-06 22:05:41,390 INFO L226 Difference]: Without dead ends: 235 [2023-11-06 22:05:41,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:05:41,392 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 713 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:41,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 829 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:05:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-11-06 22:05:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 158. [2023-11-06 22:05:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 131 states have (on average 1.3587786259541985) internal successors, (178), 131 states have internal predecessors, (178), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 228 transitions. [2023-11-06 22:05:41,418 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 228 transitions. Word has length 190 [2023-11-06 22:05:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:41,419 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 228 transitions. [2023-11-06 22:05:41,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 228 transitions. [2023-11-06 22:05:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:41,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:41,422 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:41,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:05:41,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:41,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:41,423 INFO L85 PathProgramCache]: Analyzing trace with hash 939018074, now seen corresponding path program 1 times [2023-11-06 22:05:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:41,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929781762] [2023-11-06 22:05:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:41,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:44,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:44,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929781762] [2023-11-06 22:05:44,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929781762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:44,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:44,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-06 22:05:44,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49330713] [2023-11-06 22:05:44,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:44,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 22:05:44,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:44,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 22:05:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:05:44,816 INFO L87 Difference]: Start difference. First operand 158 states and 228 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:46,808 INFO L93 Difference]: Finished difference Result 457 states and 649 transitions. [2023-11-06 22:05:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:05:46,809 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:46,812 INFO L225 Difference]: With dead ends: 457 [2023-11-06 22:05:46,813 INFO L226 Difference]: Without dead ends: 302 [2023-11-06 22:05:46,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:05:46,816 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 877 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:46,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 882 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:05:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-11-06 22:05:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 158. [2023-11-06 22:05:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 131 states have (on average 1.3587786259541985) internal successors, (178), 131 states have internal predecessors, (178), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 228 transitions. [2023-11-06 22:05:46,845 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 228 transitions. Word has length 190 [2023-11-06 22:05:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:46,845 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 228 transitions. [2023-11-06 22:05:46,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 228 transitions. [2023-11-06 22:05:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:46,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:46,849 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:05:46,849 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:46,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:46,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1460947963, now seen corresponding path program 1 times [2023-11-06 22:05:46,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:46,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486605564] [2023-11-06 22:05:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 22:05:49,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:49,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486605564] [2023-11-06 22:05:49,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486605564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:49,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:49,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-06 22:05:49,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554922505] [2023-11-06 22:05:49,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:49,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:05:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:05:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:05:49,808 INFO L87 Difference]: Start difference. First operand 158 states and 228 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:51,654 INFO L93 Difference]: Finished difference Result 454 states and 645 transitions. [2023-11-06 22:05:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:05:51,655 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 22:05:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:51,658 INFO L225 Difference]: With dead ends: 454 [2023-11-06 22:05:51,658 INFO L226 Difference]: Without dead ends: 299 [2023-11-06 22:05:51,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:05:51,660 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 634 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:51,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 999 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:05:51,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-11-06 22:05:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 152. [2023-11-06 22:05:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 125 states have (on average 1.344) internal successors, (168), 125 states have internal predecessors, (168), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:05:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 218 transitions. [2023-11-06 22:05:51,692 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 218 transitions. Word has length 190 [2023-11-06 22:05:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:51,693 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 218 transitions. [2023-11-06 22:05:51,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 22:05:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 218 transitions. [2023-11-06 22:05:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:05:51,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:51,695 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:51,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:05:51,696 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:51,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1566650078, now seen corresponding path program 1 times [2023-11-06 22:05:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385939603] [2023-11-06 22:05:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:55,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:05:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:05:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:05:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:05:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:05:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:05:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:05:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:05:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:05:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:05:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:05:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:05:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:05:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:05:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:05:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:05:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:05:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:05:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:05:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:05:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-06 22:05:56,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385939603] [2023-11-06 22:05:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385939603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:05:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142806936] [2023-11-06 22:05:56,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:56,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:05:56,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:05:56,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:05:56,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:05:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:56,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-06 22:05:56,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:05:58,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:05:59,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:59,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:05:59,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:59,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:00,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:00,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:00,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:00,764 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:01,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:01,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:01,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:01,515 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:01,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:01,809 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:02,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:02,051 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:02,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:02,251 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:02,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:02,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:02,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:06:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 1 proven. 1139 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:06:02,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:02,779 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1344 (Array Int Int))) (< 0 (mod (select (select (store |c_#memory_int| |c_~#var_1_21~0.base| v_ArrVal_1344) c_~var_1_6_Pointer~0.base) c_~var_1_6_Pointer~0.offset) 256))) is different from false [2023-11-06 22:06:02,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142806936] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:02,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:06:02,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 41 [2023-11-06 22:06:02,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240410847] [2023-11-06 22:06:02,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:02,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-06 22:06:02,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-06 22:06:02,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1433, Unknown=1, NotChecked=80, Total=1806 [2023-11-06 22:06:02,793 INFO L87 Difference]: Start difference. First operand 152 states and 218 transitions. Second operand has 41 states, 39 states have (on average 4.051282051282051) internal successors, (158), 39 states have internal predecessors, (158), 27 states have call successors, (50), 14 states have call predecessors, (50), 15 states have return successors, (50), 26 states have call predecessors, (50), 27 states have call successors, (50) [2023-11-06 22:06:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:07,485 INFO L93 Difference]: Finished difference Result 369 states and 520 transitions. [2023-11-06 22:06:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:06:07,485 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 4.051282051282051) internal successors, (158), 39 states have internal predecessors, (158), 27 states have call successors, (50), 14 states have call predecessors, (50), 15 states have return successors, (50), 26 states have call predecessors, (50), 27 states have call successors, (50) Word has length 190 [2023-11-06 22:06:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:07,488 INFO L225 Difference]: With dead ends: 369 [2023-11-06 22:06:07,488 INFO L226 Difference]: Without dead ends: 220 [2023-11-06 22:06:07,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=762, Invalid=2781, Unknown=1, NotChecked=116, Total=3660 [2023-11-06 22:06:07,491 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 592 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:07,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 788 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 22:06:07,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-06 22:06:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 160. [2023-11-06 22:06:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 states have internal predecessors, (174), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:06:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 224 transitions. [2023-11-06 22:06:07,537 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 224 transitions. Word has length 190 [2023-11-06 22:06:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:07,538 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 224 transitions. [2023-11-06 22:06:07,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 4.051282051282051) internal successors, (158), 39 states have internal predecessors, (158), 27 states have call successors, (50), 14 states have call predecessors, (50), 15 states have return successors, (50), 26 states have call predecessors, (50), 27 states have call successors, (50) [2023-11-06 22:06:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 224 transitions. [2023-11-06 22:06:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 22:06:07,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:07,540 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:07,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:06:07,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:06:07,748 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:07,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1268244171, now seen corresponding path program 1 times [2023-11-06 22:06:07,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:07,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800863557] [2023-11-06 22:06:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:07,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:06:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:06:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:06:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:06:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:06:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:06:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:06:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:06:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:06:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:06:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:06:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:06:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:06:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:06:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:06:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:06:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:06:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:06:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 22:06:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 22:06:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 22:06:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 22:06:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 22:06:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 22:06:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 22:06:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-06 22:06:13,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:13,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800863557] [2023-11-06 22:06:13,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800863557] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:13,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136772086] [2023-11-06 22:06:13,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:13,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:13,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:13,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:13,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:06:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:13,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-06 22:06:13,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:15,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:06:17,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:17,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:18,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:18,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:19,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:19,235 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:20,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:20,126 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:20,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:20,903 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:21,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:21,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:22,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:22,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:23,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:23,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:23,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:23,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:24,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:24,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:24,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:24,498 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:24,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:24,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:25,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:25,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,178 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:25,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-06 22:06:25,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,211 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 13 [2023-11-06 22:06:25,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-06 22:06:25,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,244 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:06:25,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-11-06 22:06:25,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,345 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2023-11-06 22:06:25,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:25,594 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2023-11-06 22:06:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 1154 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-06 22:06:25,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136772086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:28,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:06:28,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2023-11-06 22:06:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381068425] [2023-11-06 22:06:28,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:28,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-06 22:06:28,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-06 22:06:28,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=2812, Unknown=17, NotChecked=0, Total=3422 [2023-11-06 22:06:28,725 INFO L87 Difference]: Start difference. First operand 160 states and 224 transitions. Second operand has 53 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 26 states have call successors, (50), 14 states have call predecessors, (50), 16 states have return successors, (50), 26 states have call predecessors, (50), 26 states have call successors, (50) [2023-11-06 22:06:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:33,412 INFO L93 Difference]: Finished difference Result 459 states and 634 transitions. [2023-11-06 22:06:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:06:33,414 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 26 states have call successors, (50), 14 states have call predecessors, (50), 16 states have return successors, (50), 26 states have call predecessors, (50), 26 states have call successors, (50) Word has length 192 [2023-11-06 22:06:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:33,427 INFO L225 Difference]: With dead ends: 459 [2023-11-06 22:06:33,427 INFO L226 Difference]: Without dead ends: 302 [2023-11-06 22:06:33,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1655 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1215, Invalid=4318, Unknown=17, NotChecked=0, Total=5550 [2023-11-06 22:06:33,436 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1396 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:33,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 914 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-06 22:06:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-11-06 22:06:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 164. [2023-11-06 22:06:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 134 states have (on average 1.3208955223880596) internal successors, (177), 134 states have internal predecessors, (177), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:06:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2023-11-06 22:06:33,516 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 192 [2023-11-06 22:06:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:33,517 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2023-11-06 22:06:33,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 51 states have (on average 3.2745098039215685) internal successors, (167), 50 states have internal predecessors, (167), 26 states have call successors, (50), 14 states have call predecessors, (50), 16 states have return successors, (50), 26 states have call predecessors, (50), 26 states have call successors, (50) [2023-11-06 22:06:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2023-11-06 22:06:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 22:06:33,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:33,520 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:33,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:33,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:06:33,731 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:33,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1367387618, now seen corresponding path program 1 times [2023-11-06 22:06:33,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:33,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267775075] [2023-11-06 22:06:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:33,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:06:34,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:06:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:06:36,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:06:36,699 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:06:36,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:06:36,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:06:36,707 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:36,715 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:06:37,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:06:37 BoogieIcfgContainer [2023-11-06 22:06:37,091 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:06:37,092 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:06:37,092 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:06:37,093 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:06:37,093 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:01" (3/4) ... [2023-11-06 22:06:37,096 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:06:37,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:06:37,098 INFO L158 Benchmark]: Toolchain (without parser) took 97150.84ms. Allocated memory was 159.4MB in the beginning and 1.1GB in the end (delta: 954.2MB). Free memory was 123.4MB in the beginning and 881.0MB in the end (delta: -757.6MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. [2023-11-06 22:06:37,098 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:06:37,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.48ms. Allocated memory is still 159.4MB. Free memory was 123.4MB in the beginning and 108.6MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:06:37,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.05ms. Allocated memory is still 159.4MB. Free memory was 108.6MB in the beginning and 104.2MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:06:37,100 INFO L158 Benchmark]: Boogie Preprocessor took 61.89ms. Allocated memory is still 159.4MB. Free memory was 104.2MB in the beginning and 101.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:06:37,100 INFO L158 Benchmark]: RCFGBuilder took 969.82ms. Allocated memory is still 159.4MB. Free memory was 101.2MB in the beginning and 110.2MB in the end (delta: -8.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2023-11-06 22:06:37,101 INFO L158 Benchmark]: TraceAbstraction took 95635.01ms. Allocated memory was 159.4MB in the beginning and 1.1GB in the end (delta: 954.2MB). Free memory was 109.4MB in the beginning and 881.0MB in the end (delta: -771.6MB). Peak memory consumption was 650.7MB. Max. memory is 16.1GB. [2023-11-06 22:06:37,101 INFO L158 Benchmark]: Witness Printer took 5.11ms. Allocated memory is still 1.1GB. Free memory is still 881.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:06:37,103 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.32ms. Allocated memory is still 117.4MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.48ms. Allocated memory is still 159.4MB. Free memory was 123.4MB in the beginning and 108.6MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.05ms. Allocated memory is still 159.4MB. Free memory was 108.6MB in the beginning and 104.2MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.89ms. Allocated memory is still 159.4MB. Free memory was 104.2MB in the beginning and 101.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 969.82ms. Allocated memory is still 159.4MB. Free memory was 101.2MB in the beginning and 110.2MB in the end (delta: -8.9MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 95635.01ms. Allocated memory was 159.4MB in the beginning and 1.1GB in the end (delta: 954.2MB). Free memory was 109.4MB in the beginning and 881.0MB in the end (delta: -771.6MB). Peak memory consumption was 650.7MB. Max. memory is 16.1GB. * Witness Printer took 5.11ms. Allocated memory is still 1.1GB. Free memory is still 881.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned char var_1_5 = 0; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] unsigned char var_1_6 = 0; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_7 = 8; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_9 = 128; [L33] unsigned char* var_1_9_Pointer = &(var_1_9); [L34] unsigned char var_1_10 = 64; [L35] unsigned char* var_1_10_Pointer = &(var_1_10); [L36] unsigned char var_1_11 = 100; [L37] unsigned char* var_1_11_Pointer = &(var_1_11); [L38] unsigned char var_1_12 = 5; [L39] unsigned char* var_1_12_Pointer = &(var_1_12); [L40] unsigned char var_1_13 = 100; [L41] unsigned char* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 32; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned char var_1_15 = 64; [L45] unsigned char* var_1_15_Pointer = &(var_1_15); [L46] unsigned char var_1_16 = 50; [L47] unsigned char* var_1_16_Pointer = &(var_1_16); [L48] unsigned char var_1_17 = 8; [L49] unsigned char* var_1_17_Pointer = &(var_1_17); [L50] unsigned char var_1_18 = 0; [L51] unsigned char* var_1_18_Pointer = &(var_1_18); [L52] signed char var_1_19 = 0; [L53] signed char* var_1_19_Pointer = &(var_1_19); [L54] float var_1_20 = 255.5; [L55] float* var_1_20_Pointer = &(var_1_20); [L56] float var_1_21 = 255.5; [L57] float* var_1_21_Pointer = &(var_1_21); [L58] unsigned short int var_1_22 = 64; [L59] unsigned short int* var_1_22_Pointer = &(var_1_22); [L60] double var_1_23 = 32.5; [L61] double* var_1_23_Pointer = &(var_1_23); VAL [isInitial=0, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] FCALL updateLastVariables() [L141] CALL updateVariables() [L91] var_1_4 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_4) VAL [\read(var_1_4)=512, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] RET assume_abort_if_not(var_1_4 >= 0) VAL [\read(var_1_4)=512, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] EXPR \read(var_1_4) VAL [\read(var_1_4)=512, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L93] RET assume_abort_if_not(var_1_4 <= 0) VAL [\read(var_1_4)=512, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L94] var_1_5 = __VERIFIER_nondet_uchar() [L95] EXPR \read(var_1_5) VAL [\read(var_1_5)=-256, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L95] RET assume_abort_if_not(var_1_5 >= 0) VAL [\read(var_1_5)=-256, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] EXPR \read(var_1_5) VAL [\read(var_1_5)=-256, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L96] RET assume_abort_if_not(var_1_5 <= 0) VAL [\read(var_1_5)=-256, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L97] var_1_6 = __VERIFIER_nondet_uchar() [L98] EXPR \read(var_1_6) VAL [\read(var_1_6)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L98] RET assume_abort_if_not(var_1_6 >= 1) VAL [\read(var_1_6)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR \read(var_1_6) VAL [\read(var_1_6)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] RET assume_abort_if_not(var_1_6 <= 1) VAL [\read(var_1_6)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L100] var_1_9 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_9) VAL [\read(var_1_9)=-2, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L101] RET assume_abort_if_not(var_1_9 >= 127) VAL [\read(var_1_9)=-2, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] EXPR \read(var_1_9) VAL [\read(var_1_9)=-2, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L102] RET assume_abort_if_not(var_1_9 <= 254) VAL [\read(var_1_9)=-2, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L103] var_1_10 = __VERIFIER_nondet_uchar() [L104] EXPR \read(var_1_10) VAL [\read(var_1_10)=27, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L104] RET assume_abort_if_not(var_1_10 >= 0) VAL [\read(var_1_10)=27, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] EXPR \read(var_1_10) VAL [\read(var_1_10)=27, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L105] RET assume_abort_if_not(var_1_10 <= 127) VAL [\read(var_1_10)=27, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L106] var_1_12 = __VERIFIER_nondet_uchar() [L107] EXPR \read(var_1_12) VAL [\read(var_1_12)=26, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] RET assume_abort_if_not(var_1_12 >= 0) VAL [\read(var_1_12)=26, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] EXPR \read(var_1_12) VAL [\read(var_1_12)=26, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L108] RET assume_abort_if_not(var_1_12 <= 127) VAL [\read(var_1_12)=26, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L109] var_1_13 = __VERIFIER_nondet_uchar() [L110] EXPR \read(var_1_13) VAL [\read(var_1_13)=768, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L110] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L110] RET assume_abort_if_not(var_1_13 >= 0) VAL [\read(var_1_13)=768, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] EXPR \read(var_1_13) VAL [\read(var_1_13)=768, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L111] RET assume_abort_if_not(var_1_13 <= 127) VAL [\read(var_1_13)=768, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L112] var_1_14 = __VERIFIER_nondet_uchar() [L113] EXPR \read(var_1_14) VAL [\read(var_1_14)=-193, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] CALL assume_abort_if_not(var_1_14 >= 32) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L113] RET assume_abort_if_not(var_1_14 >= 32) VAL [\read(var_1_14)=-193, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] EXPR \read(var_1_14) VAL [\read(var_1_14)=-193, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L114] RET assume_abort_if_not(var_1_14 <= 63) VAL [\read(var_1_14)=-193, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L115] var_1_15 = __VERIFIER_nondet_uchar() [L116] EXPR \read(var_1_15) VAL [\read(var_1_15)=-479, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L116] CALL assume_abort_if_not(var_1_15 >= 32) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L116] RET assume_abort_if_not(var_1_15 >= 32) VAL [\read(var_1_15)=-479, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L117] EXPR \read(var_1_15) VAL [\read(var_1_15)=-479, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L117] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L117] RET assume_abort_if_not(var_1_15 <= 64) VAL [\read(var_1_15)=-479, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L118] var_1_16 = __VERIFIER_nondet_uchar() [L119] EXPR \read(var_1_16) VAL [\read(var_1_16)=-224, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] CALL assume_abort_if_not(var_1_16 >= 32) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L119] RET assume_abort_if_not(var_1_16 >= 32) VAL [\read(var_1_16)=-224, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L120] EXPR \read(var_1_16) VAL [\read(var_1_16)=-224, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L120] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L120] RET assume_abort_if_not(var_1_16 <= 63) VAL [\read(var_1_16)=-224, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L121] var_1_17 = __VERIFIER_nondet_uchar() [L122] EXPR \read(var_1_17) VAL [\read(var_1_17)=25, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L122] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L122] RET assume_abort_if_not(var_1_17 >= 0) VAL [\read(var_1_17)=25, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L123] EXPR \read(var_1_17) VAL [\read(var_1_17)=25, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L123] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L123] RET assume_abort_if_not(var_1_17 <= 64) VAL [\read(var_1_17)=25, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L124] var_1_18 = __VERIFIER_nondet_uchar() [L125] EXPR \read(var_1_18) VAL [\read(var_1_18)=280, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L125] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [\read(var_1_18)=280, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L126] EXPR \read(var_1_18) VAL [\read(var_1_18)=280, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L126] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L126] RET assume_abort_if_not(var_1_18 <= 63) VAL [\read(var_1_18)=280, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L127] var_1_21 = __VERIFIER_nondet_float() [L128] EXPR \read(var_1_21) [L128] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F [L128] EXPR \read(var_1_21) [L128] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [\read(var_1_21)=811, \read(var_1_21)=811, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L128] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [(var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )=1, \read(var_1_21)=811, \read(var_1_21)=811, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F=1, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L128] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L128] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [(var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )=1, \read(var_1_21)=811, \read(var_1_21)=811, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F=1, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L141] RET updateVariables() [L142] CALL step() [L65] EXPR \read(*var_1_6_Pointer) VAL [\read(*var_1_6_Pointer)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L65] COND TRUE (*(var_1_6_Pointer)) [L66] EXPR \read(*var_1_10_Pointer) [L66] EXPR \read(*var_1_12_Pointer) [L66] EXPR \read(*var_1_13_Pointer) VAL [\read(*var_1_10_Pointer)=27, \read(*var_1_12_Pointer)=26, \read(*var_1_13_Pointer)=768, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L66] EXPR (((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))) [L66] EXPR \read(*var_1_12_Pointer) [L66] EXPR (((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))) VAL [(((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))=26, \read(*var_1_10_Pointer)=27, \read(*var_1_12_Pointer)=26, \read(*var_1_12_Pointer)=26, \read(*var_1_13_Pointer)=768, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L66] (*(var_1_11_Pointer)) = ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))) [L70] EXPR \read(*var_1_6_Pointer) [L70] EXPR (*(var_1_6_Pointer)) || (*(var_1_4_Pointer)) VAL [(*(var_1_6_Pointer)) || (*(var_1_4_Pointer))=1, \read(*var_1_6_Pointer)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L70] unsigned char stepLocal_0 = (*(var_1_6_Pointer)) || (*(var_1_4_Pointer)); [L71] EXPR \read(*var_1_5_Pointer) VAL [\read(*var_1_5_Pointer)=-256, isInitial=1, stepLocal_0=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L71] COND TRUE (*(var_1_5_Pointer)) || stepLocal_0 [L72] EXPR \read(*var_1_15_Pointer) [L72] (*(var_1_19_Pointer)) = (*(var_1_15_Pointer)) [L74] EXPR \read(*var_1_21_Pointer) [L74] (*(var_1_20_Pointer)) = (*(var_1_21_Pointer)) [L75] EXPR \read(*var_1_18_Pointer) [L75] (*(var_1_22_Pointer)) = (*(var_1_18_Pointer)) [L76] (*(var_1_23_Pointer)) = 0.010000000000000009 [L77] EXPR \read(*var_1_20_Pointer) [L77] EXPR \read(*var_1_20_Pointer) VAL [\read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, isInitial=1, stepLocal_0=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L77] COND FALSE !((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) [L80] EXPR \read(*var_1_20_Pointer) [L80] EXPR \read(*var_1_20_Pointer) VAL [\read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, isInitial=1, stepLocal_0=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] COND TRUE (*(var_1_20_Pointer)) >= (*(var_1_20_Pointer)) [L81] EXPR \read(*var_1_5_Pointer) [L81] (*(var_1_1_Pointer)) = (*(var_1_5_Pointer)) [L86] EXPR \read(*var_1_23_Pointer) [L86] EXPR \read(*var_1_20_Pointer) [L86] EXPR \read(*var_1_20_Pointer) VAL [\read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_23_Pointer)=10000000000000009/1000000000000000000, isInitial=1, stepLocal_0=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] EXPR (((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer))) [L86] EXPR \read(*var_1_20_Pointer) [L86] EXPR (((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer))) VAL [(((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_23_Pointer)=10000000000000009/1000000000000000000, isInitial=1, stepLocal_0=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] COND FALSE !((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR \read(*var_1_20_Pointer) [L133] EXPR \read(*var_1_20_Pointer) VAL [\read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) [L133] EXPR \read(*var_1_20_Pointer) [L133] EXPR \read(*var_1_20_Pointer) VAL [\read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) [L133] EXPR \read(*var_1_1_Pointer) [L133] EXPR \read(*var_1_6_Pointer) [L133] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))=0, \read(*var_1_1_Pointer)=-256, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_6_Pointer)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))) VAL [((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))=0, ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))=0, \read(*var_1_1_Pointer)=-256, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_6_Pointer)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR (((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1) VAL [(((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)=0, ((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))=0, ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))=0, \read(*var_1_1_Pointer)=-256, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_6_Pointer)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer))))))) VAL [((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))=0, (((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)=0, ((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))=0, ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))=0, \read(*var_1_1_Pointer)=-256, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_6_Pointer)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR (((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1) VAL [(((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)=0, ((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))=0, (((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)=0, ((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))=0, ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))=0, \read(*var_1_1_Pointer)=-256, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_6_Pointer)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))=0, (((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)=0, ((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))=0, (((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)=0, ((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))=0, ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))=0, \read(*var_1_1_Pointer)=-256, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_6_Pointer)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR (((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer)))) VAL [(((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))=0, ((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))=0, (((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)=0, ((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))=0, (((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)=0, ((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))=0, ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))=0, \read(*var_1_1_Pointer)=-256, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_6_Pointer)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L133] EXPR ((((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && ((*(var_1_23_Pointer)) == ((double) 0.010000000000000009)) VAL [((((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && ((*(var_1_23_Pointer)) == ((double) 0.010000000000000009))=0, (((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))=0, ((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))=0, (((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)=0, ((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))=0, (((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)=0, ((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))=0, ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer))))=0, \read(*var_1_1_Pointer)=-256, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_20_Pointer)=811, \read(*var_1_6_Pointer)=-255, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L133-L134] return ((((((((*(var_1_20_Pointer)) < (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))))) : (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_5_Pointer)))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))))) && (((*(var_1_23_Pointer)) < (((((*(var_1_20_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_20_Pointer))) : ((*(var_1_20_Pointer)))))) ? ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) - (*(var_1_10_Pointer))))) : 1)) && ((*(var_1_6_Pointer)) ? ((*(var_1_11_Pointer)) == ((unsigned char) ((*(var_1_10_Pointer)) + (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer)))))))) : ((*(var_1_11_Pointer)) == ((unsigned char) (((64 + (*(var_1_14_Pointer))) + ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer)))) - ((*(var_1_17_Pointer)) + (*(var_1_18_Pointer)))))))) && (((*(var_1_5_Pointer)) || ((*(var_1_6_Pointer)) || (*(var_1_4_Pointer)))) ? ((*(var_1_19_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned short int) (*(var_1_18_Pointer))))) && ((*(var_1_23_Pointer)) == ((double) 0.010000000000000009)) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_23={23:0}, var_1_23_Pointer={23:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 95.2s, OverallIterations: 19, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7655 SdHoareTripleChecker+Valid, 14.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7655 mSDsluCounter, 12238 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9569 mSDsCounter, 802 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11013 IncrementalHoareTripleChecker+Invalid, 11815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 802 mSolverCounterUnsat, 2669 mSDtfsCounter, 11013 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1711 GetRequests, 1373 SyntacticMatches, 2 SemanticMatches, 336 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2765 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=18, InterpolantAutomatonStates: 208, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 1339 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 14.1s SatisfiabilityAnalysisTime, 52.0s InterpolantComputationTime, 3996 NumberOfCodeBlocks, 3996 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3784 ConstructedInterpolants, 1 QuantifiedInterpolants, 46399 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1638 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 21575/24000 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:06:37,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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 952f1621c7899c5ce964b8bd35a2296981cb24cd167b0d1d0e9f7406c8d49f3b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:06:40,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:06:40,377 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:06:40,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:06:40,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:06:40,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:06:40,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:06:40,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:06:40,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:06:40,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:06:40,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:06:40,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:06:40,443 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:06:40,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:06:40,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:06:40,445 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:06:40,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:06:40,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:06:40,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:06:40,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:06:40,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:06:40,449 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:06:40,450 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:06:40,450 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:06:40,451 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:06:40,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:06:40,452 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:06:40,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:06:40,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:06:40,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:06:40,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:40,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:06:40,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:06:40,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:06:40,457 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:06:40,457 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:06:40,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:06:40,458 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:06:40,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:06:40,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:06:40,459 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:06:40,460 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:06:40,460 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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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 -> 952f1621c7899c5ce964b8bd35a2296981cb24cd167b0d1d0e9f7406c8d49f3b [2023-11-06 22:06:40,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:06:40,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:06:40,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:06:40,965 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:06:40,966 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:06:40,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i [2023-11-06 22:06:44,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:06:44,994 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:06:44,997 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i [2023-11-06 22:06:45,014 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/data/4268ba04f/45df9f4694124a2f8d8c54a863623270/FLAG77e689d23 [2023-11-06 22:06:45,033 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/data/4268ba04f/45df9f4694124a2f8d8c54a863623270 [2023-11-06 22:06:45,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:06:45,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:06:45,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:45,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:06:45,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:06:45,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8f73eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45, skipping insertion in model container [2023-11-06 22:06:45,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,095 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:06:45,291 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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i[916,929] [2023-11-06 22:06:45,373 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:45,412 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:06:45,432 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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i[916,929] [2023-11-06 22:06:45,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:06:45,563 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:06:45,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45 WrapperNode [2023-11-06 22:06:45,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:06:45,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:45,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:06:45,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:06:45,591 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:06:45" (1/1) ... [2023-11-06 22:06:45,660 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:06:45" (1/1) ... [2023-11-06 22:06:45,748 INFO L138 Inliner]: procedures = 36, calls = 203, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2023-11-06 22:06:45,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:06:45,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:06:45,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:06:45,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:06:45,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:06:45,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:06:45,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:06:45,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:06:45,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45" (1/1) ... [2023-11-06 22:06:45,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:06:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:45,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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:06:45,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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:06:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:06:46,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 22:06:46,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 22:06:46,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:06:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:06:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:06:46,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:06:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 22:06:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:06:46,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:06:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:06:46,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:06:46,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:06:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:06:46,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:06:46,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:06:46,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:06:46,264 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:06:46,267 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:06:47,700 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:06:47,710 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:06:47,710 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:06:47,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:47 BoogieIcfgContainer [2023-11-06 22:06:47,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:06:47,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:06:47,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:06:47,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:06:47,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:06:45" (1/3) ... [2023-11-06 22:06:47,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b04d912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:47, skipping insertion in model container [2023-11-06 22:06:47,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:45" (2/3) ... [2023-11-06 22:06:47,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b04d912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:47, skipping insertion in model container [2023-11-06 22:06:47,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:47" (3/3) ... [2023-11-06 22:06:47,728 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-61.i [2023-11-06 22:06:47,752 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:06:47,752 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:06:47,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:06:47,822 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;@5e28b5d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:06:47,822 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:06:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 22:06:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 22:06:47,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:47,851 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:47,852 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:47,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1439989331, now seen corresponding path program 1 times [2023-11-06 22:06:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:06:47,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953408623] [2023-11-06 22:06:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:47,883 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:06:47,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:06:47,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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:06:47,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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:06:48,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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)] Forceful destruction successful, exit code 139 [2023-11-06 22:06:48,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:06:48,582 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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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:06:48,589 INFO L158 Benchmark]: Toolchain (without parser) took 3541.98ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 51.5MB in the beginning and 50.2MB in the end (delta: 1.3MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2023-11-06 22:06:48,590 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 75.5MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:06:48,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.62ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 35.9MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:06:48,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 168.08ms. Allocated memory is still 96.5MB. Free memory was 75.9MB in the beginning and 72.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:06:48,592 INFO L158 Benchmark]: Boogie Preprocessor took 147.39ms. Allocated memory is still 96.5MB. Free memory was 72.8MB in the beginning and 69.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:06:48,593 INFO L158 Benchmark]: RCFGBuilder took 1815.88ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 55.1MB in the end (delta: 14.2MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2023-11-06 22:06:48,594 INFO L158 Benchmark]: TraceAbstraction took 870.33ms. Allocated memory is still 96.5MB. Free memory was 54.3MB in the beginning and 50.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2023-11-06 22:06:48,599 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 75.5MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.62ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 35.9MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 168.08ms. Allocated memory is still 96.5MB. Free memory was 75.9MB in the beginning and 72.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 147.39ms. Allocated memory is still 96.5MB. Free memory was 72.8MB in the beginning and 69.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1815.88ms. Allocated memory is still 96.5MB. Free memory was 69.3MB in the beginning and 55.1MB in the end (delta: 14.2MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * TraceAbstraction took 870.33ms. Allocated memory is still 96.5MB. Free memory was 54.3MB in the beginning and 50.2MB in the end (delta: 4.1MB). Peak memory consumption was 4.0MB. 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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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:06:48,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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_58b50f50-b366-474e-a7ee-ec2728f5f0bf/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.