./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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 c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:47:47,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:47:48,104 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:47:48,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:47:48,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:47:48,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:47:48,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:47:48,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:47:48,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:47:48,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:47:48,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:47:48,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:47:48,166 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:47:48,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:47:48,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:47:48,169 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:47:48,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:47:48,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:47:48,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:47:48,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:47:48,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:47:48,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:47:48,172 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:47:48,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:47:48,173 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:47:48,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:47:48,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:47:48,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:47:48,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:48,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:47:48,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:47:48,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:47:48,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:47:48,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:47:48,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:47:48,178 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:47:48,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:47:48,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:47:48,179 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:47:48,179 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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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 -> c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5 [2023-11-06 22:47:48,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:47:48,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:47:48,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:47:48,544 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:47:48,545 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:47:48,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i [2023-11-06 22:47:51,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:47:52,058 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:47:52,059 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i [2023-11-06 22:47:52,070 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/data/1b050142e/bc799c47e6234ed5b3a1c2759066ac83/FLAGe6c168582 [2023-11-06 22:47:52,087 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/data/1b050142e/bc799c47e6234ed5b3a1c2759066ac83 [2023-11-06 22:47:52,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:47:52,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:47:52,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:52,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:47:52,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:47:52,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63fc0808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52, skipping insertion in model container [2023-11-06 22:47:52,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,163 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:47:52,356 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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i[917,930] [2023-11-06 22:47:52,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:52,437 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:47:52,454 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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i[917,930] [2023-11-06 22:47:52,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:52,555 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:47:52,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52 WrapperNode [2023-11-06 22:47:52,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:52,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:52,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:47:52,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:47:52,565 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:47:52" (1/1) ... [2023-11-06 22:47:52,578 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:47:52" (1/1) ... [2023-11-06 22:47:52,625 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 399 [2023-11-06 22:47:52,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:52,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:47:52,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:47:52,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:47:52,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:47:52,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:47:52,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:47:52,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:47:52,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52" (1/1) ... [2023-11-06 22:47:52,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:52,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:52,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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:47:52,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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:47:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:47:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:47:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:47:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:47:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:47:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:47:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:47:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:47:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:47:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:47:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:47:52,915 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:47:52,918 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:47:53,631 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:47:53,644 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:47:53,644 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:47:53,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:53 BoogieIcfgContainer [2023-11-06 22:47:53,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:47:53,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:47:53,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:47:53,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:47:53,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:52" (1/3) ... [2023-11-06 22:47:53,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118220bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:53, skipping insertion in model container [2023-11-06 22:47:53,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:52" (2/3) ... [2023-11-06 22:47:53,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118220bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:53, skipping insertion in model container [2023-11-06 22:47:53,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:53" (3/3) ... [2023-11-06 22:47:53,663 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-97.i [2023-11-06 22:47:53,688 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:47:53,688 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:47:53,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:47:53,760 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;@1f258d7f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:47:53,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:47:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 87 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:47:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:47:53,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:53,786 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:53,787 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:53,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:53,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1890659154, now seen corresponding path program 1 times [2023-11-06 22:47:53,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:53,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836404851] [2023-11-06 22:47:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:53,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:47:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:47:54,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836404851] [2023-11-06 22:47:54,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836404851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:54,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:54,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:54,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626973587] [2023-11-06 22:47:54,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:54,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:47:54,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:47:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:47:54,702 INFO L87 Difference]: Start difference. First operand has 106 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 87 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:47:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:54,741 INFO L93 Difference]: Finished difference Result 205 states and 321 transitions. [2023-11-06 22:47:54,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:47:54,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2023-11-06 22:47:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:54,755 INFO L225 Difference]: With dead ends: 205 [2023-11-06 22:47:54,755 INFO L226 Difference]: Without dead ends: 102 [2023-11-06 22:47:54,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:47:54,764 INFO L413 NwaCegarLoop]: 148 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, 148 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:47:54,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:47:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-06 22:47:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-06 22:47:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:47:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 148 transitions. [2023-11-06 22:47:54,826 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 148 transitions. Word has length 134 [2023-11-06 22:47:54,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:54,827 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 148 transitions. [2023-11-06 22:47:54,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:47:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 148 transitions. [2023-11-06 22:47:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:47:54,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:54,834 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:54,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:47:54,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:54,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1744642164, now seen corresponding path program 1 times [2023-11-06 22:47:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717272029] [2023-11-06 22:47:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:54,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:47:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:47:55,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:55,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717272029] [2023-11-06 22:47:55,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717272029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:55,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:55,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:55,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922892332] [2023-11-06 22:47:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:55,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:55,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:55,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:55,552 INFO L87 Difference]: Start difference. First operand 102 states and 148 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:55,686 INFO L93 Difference]: Finished difference Result 227 states and 332 transitions. [2023-11-06 22:47:55,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:55,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-11-06 22:47:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:55,693 INFO L225 Difference]: With dead ends: 227 [2023-11-06 22:47:55,693 INFO L226 Difference]: Without dead ends: 128 [2023-11-06 22:47:55,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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:47:55,696 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 64 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:55,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 457 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:47:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-06 22:47:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 104. [2023-11-06 22:47:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:47:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2023-11-06 22:47:55,724 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 134 [2023-11-06 22:47:55,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:55,728 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2023-11-06 22:47:55,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2023-11-06 22:47:55,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:47:55,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:55,733 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:55,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:47:55,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:55,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1581331390, now seen corresponding path program 1 times [2023-11-06 22:47:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:55,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536096882] [2023-11-06 22:47:55,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:47:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:47:56,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:56,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536096882] [2023-11-06 22:47:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536096882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:56,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:56,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:56,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578666272] [2023-11-06 22:47:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:56,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:56,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:56,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:56,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:56,067 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:56,111 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2023-11-06 22:47:56,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:56,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-11-06 22:47:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:56,115 INFO L225 Difference]: With dead ends: 217 [2023-11-06 22:47:56,115 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 22:47:56,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:47:56,118 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 21 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:56,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 431 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:47:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 22:47:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2023-11-06 22:47:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:47:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2023-11-06 22:47:56,133 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 136 [2023-11-06 22:47:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:56,134 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2023-11-06 22:47:56,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2023-11-06 22:47:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:47:56,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:56,139 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:47:56,139 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:56,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:56,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2033577536, now seen corresponding path program 1 times [2023-11-06 22:47:56,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:56,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119248626] [2023-11-06 22:47:56,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:56,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:47:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:47:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119248626] [2023-11-06 22:47:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119248626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:56,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:56,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:56,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503004056] [2023-11-06 22:47:56,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:56,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:56,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:56,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:56,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:56,376 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:56,435 INFO L93 Difference]: Finished difference Result 217 states and 312 transitions. [2023-11-06 22:47:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:56,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-11-06 22:47:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:56,438 INFO L225 Difference]: With dead ends: 217 [2023-11-06 22:47:56,438 INFO L226 Difference]: Without dead ends: 114 [2023-11-06 22:47:56,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:47:56,441 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 12 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 429 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:47:56,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 429 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:47:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-06 22:47:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-11-06 22:47:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:47:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2023-11-06 22:47:56,455 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 136 [2023-11-06 22:47:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:56,456 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2023-11-06 22:47:56,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2023-11-06 22:47:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:47:56,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:56,459 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:47:56,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:56,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -258570174, now seen corresponding path program 1 times [2023-11-06 22:47:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:56,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950679131] [2023-11-06 22:47:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:47:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:47:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950679131] [2023-11-06 22:47:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950679131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:56,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:56,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:56,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85683615] [2023-11-06 22:47:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:56,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:56,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:56,681 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:56,714 INFO L93 Difference]: Finished difference Result 217 states and 310 transitions. [2023-11-06 22:47:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:47:56,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-11-06 22:47:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:56,717 INFO L225 Difference]: With dead ends: 217 [2023-11-06 22:47:56,717 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:47:56,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:47:56,720 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 428 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:47:56,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 428 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:47:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:47:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-11-06 22:47:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:47:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2023-11-06 22:47:56,732 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 136 [2023-11-06 22:47:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:56,733 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2023-11-06 22:47:56,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2023-11-06 22:47:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:47:56,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:56,736 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:47:56,736 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:56,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash -256723132, now seen corresponding path program 1 times [2023-11-06 22:47:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:56,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258788366] [2023-11-06 22:47:56,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:47:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:47:57,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:57,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258788366] [2023-11-06 22:47:57,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258788366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:57,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:57,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:47:57,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613561643] [2023-11-06 22:47:57,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:57,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:47:57,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:57,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:47:57,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:47:57,632 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:58,003 INFO L93 Difference]: Finished difference Result 231 states and 331 transitions. [2023-11-06 22:47:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:58,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-11-06 22:47:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:58,007 INFO L225 Difference]: With dead ends: 231 [2023-11-06 22:47:58,007 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:47:58,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:47:58,015 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 135 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:58,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 450 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:47:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:47:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2023-11-06 22:47:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:47:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 171 transitions. [2023-11-06 22:47:58,049 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 171 transitions. Word has length 136 [2023-11-06 22:47:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:58,050 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 171 transitions. [2023-11-06 22:47:58,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 171 transitions. [2023-11-06 22:47:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:47:58,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:58,053 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:58,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:47:58,053 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:58,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:58,054 INFO L85 PathProgramCache]: Analyzing trace with hash -390736638, now seen corresponding path program 1 times [2023-11-06 22:47:58,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:58,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279664786] [2023-11-06 22:47:58,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:58,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:47:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:47:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:59,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279664786] [2023-11-06 22:47:59,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279664786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:59,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:59,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:47:59,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555448693] [2023-11-06 22:47:59,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:59,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:47:59,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:59,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:47:59,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:47:59,223 INFO L87 Difference]: Start difference. First operand 120 states and 171 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:59,676 INFO L93 Difference]: Finished difference Result 280 states and 395 transitions. [2023-11-06 22:47:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:47:59,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-11-06 22:47:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:59,678 INFO L225 Difference]: With dead ends: 280 [2023-11-06 22:47:59,679 INFO L226 Difference]: Without dead ends: 163 [2023-11-06 22:47:59,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:47:59,687 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 306 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:59,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 408 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:47:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-06 22:47:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 122. [2023-11-06 22:47:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:47:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 173 transitions. [2023-11-06 22:47:59,703 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 173 transitions. Word has length 136 [2023-11-06 22:47:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:59,704 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 173 transitions. [2023-11-06 22:47:59,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:47:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 173 transitions. [2023-11-06 22:47:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:47:59,710 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:59,710 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:59,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:47:59,710 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:59,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 535526603, now seen corresponding path program 1 times [2023-11-06 22:47:59,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:59,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35036765] [2023-11-06 22:47:59,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-11-06 22:48:03,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:03,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35036765] [2023-11-06 22:48:03,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35036765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:48:03,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865987652] [2023-11-06 22:48:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:03,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:03,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:03,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:48:03,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:48:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:04,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-06 22:48:04,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:08,335 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:48:09,497 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 13 [2023-11-06 22:48:10,332 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 13 [2023-11-06 22:48:10,966 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 13 [2023-11-06 22:48:11,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:11,613 INFO L322 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-11-06 22:48:11,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 84 [2023-11-06 22:48:11,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2023-11-06 22:48:11,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 17 [2023-11-06 22:48:11,755 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2023-11-06 22:48:11,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:11,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:11,791 INFO L322 Elim1Store]: treesize reduction 146, result has 0.7 percent of original size [2023-11-06 22:48:11,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 92 [2023-11-06 22:48:11,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:11,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:11,859 INFO L322 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2023-11-06 22:48:11,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 296 treesize of output 259 [2023-11-06 22:48:11,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:11,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:11,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:11,987 INFO L322 Elim1Store]: treesize reduction 338, result has 0.3 percent of original size [2023-11-06 22:48:11,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 180 treesize of output 212 [2023-11-06 22:48:12,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:12,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:12,106 INFO L322 Elim1Store]: treesize reduction 211, result has 0.5 percent of original size [2023-11-06 22:48:12,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 304 treesize of output 259 [2023-11-06 22:48:12,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:12,219 INFO L322 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2023-11-06 22:48:12,219 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 66 [2023-11-06 22:48:12,402 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:48:12,402 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2023-11-06 22:48:12,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:12,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:12,538 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:48:12,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2023-11-06 22:48:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 235 proven. 79 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-11-06 22:48:12,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:48:15,363 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base))) (and (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int) (v_ArrVal_514 Int) (v_ArrVal_512 Int)) (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_18_Pointer~0.offset v_ArrVal_512)))) (store .cse3 c_~WrapperStruct00_var_1_20_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset v_ArrVal_514))))) (store .cse2 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (select (select .cse2 ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset)))))) (or (forall ((v_ArrVal_519 Int)) (< 0 (mod (select (select (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_519))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (= (mod (select (select .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)))) (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int) (v_ArrVal_514 Int) (v_ArrVal_512 Int)) (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base (store .cse4 c_~WrapperStruct00_var_1_18_Pointer~0.offset v_ArrVal_512)))) (store .cse8 c_~WrapperStruct00_var_1_20_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset v_ArrVal_514))))) (store .cse7 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse7 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (select (select .cse7 ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset)))))) (or (forall ((v_ArrVal_519 Int)) (< 0 (mod (select (select (let ((.cse5 (store .cse6 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_519))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (not (= (mod (select (select .cse6 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))))) is different from false [2023-11-06 22:48:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865987652] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:48:15,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:48:15,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 27 [2023-11-06 22:48:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101068767] [2023-11-06 22:48:15,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:48:15,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 22:48:15,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:15,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 22:48:15,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=880, Unknown=1, NotChecked=60, Total=1056 [2023-11-06 22:48:15,507 INFO L87 Difference]: Start difference. First operand 122 states and 173 transitions. Second operand has 27 states, 24 states have (on average 4.25) internal successors, (102), 26 states have internal predecessors, (102), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2023-11-06 22:48:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:20,144 INFO L93 Difference]: Finished difference Result 355 states and 498 transitions. [2023-11-06 22:48:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:48:20,145 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 4.25) internal successors, (102), 26 states have internal predecessors, (102), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) Word has length 136 [2023-11-06 22:48:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:20,147 INFO L225 Difference]: With dead ends: 355 [2023-11-06 22:48:20,147 INFO L226 Difference]: Without dead ends: 236 [2023-11-06 22:48:20,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=352, Invalid=1907, Unknown=1, NotChecked=92, Total=2352 [2023-11-06 22:48:20,151 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 369 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 2151 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:20,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1478 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2151 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-06 22:48:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-11-06 22:48:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 219. [2023-11-06 22:48:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.305084745762712) internal successors, (231), 179 states have internal predecessors, (231), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-06 22:48:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 305 transitions. [2023-11-06 22:48:20,191 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 305 transitions. Word has length 136 [2023-11-06 22:48:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:20,192 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 305 transitions. [2023-11-06 22:48:20,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 4.25) internal successors, (102), 26 states have internal predecessors, (102), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2023-11-06 22:48:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 305 transitions. [2023-11-06 22:48:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-06 22:48:20,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:20,196 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:20,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:20,408 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:20,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:20,409 INFO L85 PathProgramCache]: Analyzing trace with hash 174670052, now seen corresponding path program 1 times [2023-11-06 22:48:20,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:20,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064190448] [2023-11-06 22:48:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:22,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:22,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064190448] [2023-11-06 22:48:22,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064190448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:22,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:22,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:48:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796650370] [2023-11-06 22:48:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:22,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:48:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:22,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:48:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:48:22,166 INFO L87 Difference]: Start difference. First operand 219 states and 305 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:23,135 INFO L93 Difference]: Finished difference Result 478 states and 664 transitions. [2023-11-06 22:48:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:48:23,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2023-11-06 22:48:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:23,140 INFO L225 Difference]: With dead ends: 478 [2023-11-06 22:48:23,140 INFO L226 Difference]: Without dead ends: 287 [2023-11-06 22:48:23,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:48:23,142 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 300 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:23,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 513 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:48:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-11-06 22:48:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2023-11-06 22:48:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 187 states have (on average 1.2994652406417113) internal successors, (243), 189 states have internal predecessors, (243), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-06 22:48:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 317 transitions. [2023-11-06 22:48:23,183 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 317 transitions. Word has length 136 [2023-11-06 22:48:23,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:23,184 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 317 transitions. [2023-11-06 22:48:23,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 317 transitions. [2023-11-06 22:48:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:48:23,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:23,186 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:23,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:48:23,187 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:23,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:23,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2023958658, now seen corresponding path program 1 times [2023-11-06 22:48:23,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:23,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305812210] [2023-11-06 22:48:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:23,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:23,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305812210] [2023-11-06 22:48:23,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305812210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:23,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:23,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:48:23,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555217291] [2023-11-06 22:48:23,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:23,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:23,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:23,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:23,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:23,648 INFO L87 Difference]: Start difference. First operand 229 states and 317 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:24,014 INFO L93 Difference]: Finished difference Result 633 states and 878 transitions. [2023-11-06 22:48:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:48:24,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2023-11-06 22:48:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:24,018 INFO L225 Difference]: With dead ends: 633 [2023-11-06 22:48:24,018 INFO L226 Difference]: Without dead ends: 432 [2023-11-06 22:48:24,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:48:24,020 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 200 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:24,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 749 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:48:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-11-06 22:48:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 234. [2023-11-06 22:48:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 194 states have internal predecessors, (250), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-06 22:48:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 324 transitions. [2023-11-06 22:48:24,061 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 324 transitions. Word has length 137 [2023-11-06 22:48:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:24,062 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 324 transitions. [2023-11-06 22:48:24,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 324 transitions. [2023-11-06 22:48:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:48:24,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:24,065 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:24,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:48:24,065 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:24,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1344745397, now seen corresponding path program 1 times [2023-11-06 22:48:24,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:24,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123431050] [2023-11-06 22:48:24,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:24,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:24,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:24,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:25,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:25,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123431050] [2023-11-06 22:48:25,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123431050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:25,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:25,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:48:25,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325086598] [2023-11-06 22:48:25,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:25,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:48:25,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:25,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:48:25,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:48:25,083 INFO L87 Difference]: Start difference. First operand 234 states and 324 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:25,705 INFO L93 Difference]: Finished difference Result 543 states and 754 transitions. [2023-11-06 22:48:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:25,706 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2023-11-06 22:48:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:25,709 INFO L225 Difference]: With dead ends: 543 [2023-11-06 22:48:25,709 INFO L226 Difference]: Without dead ends: 337 [2023-11-06 22:48:25,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:48:25,711 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 305 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:25,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 549 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:48:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-06 22:48:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 250. [2023-11-06 22:48:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 208 states have (on average 1.3125) internal successors, (273), 210 states have internal predecessors, (273), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-06 22:48:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 347 transitions. [2023-11-06 22:48:25,758 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 347 transitions. Word has length 137 [2023-11-06 22:48:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:25,758 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 347 transitions. [2023-11-06 22:48:25,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 347 transitions. [2023-11-06 22:48:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:48:25,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:25,761 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:25,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:48:25,762 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:25,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1204196787, now seen corresponding path program 1 times [2023-11-06 22:48:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:25,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762084041] [2023-11-06 22:48:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:26,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:26,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762084041] [2023-11-06 22:48:26,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762084041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:26,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:26,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:48:26,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138890178] [2023-11-06 22:48:26,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:26,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:48:26,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:26,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:48:26,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:48:26,798 INFO L87 Difference]: Start difference. First operand 250 states and 347 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:27,500 INFO L93 Difference]: Finished difference Result 511 states and 708 transitions. [2023-11-06 22:48:27,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:27,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2023-11-06 22:48:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:27,505 INFO L225 Difference]: With dead ends: 511 [2023-11-06 22:48:27,505 INFO L226 Difference]: Without dead ends: 289 [2023-11-06 22:48:27,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:48:27,507 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 269 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:27,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 401 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:48:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-11-06 22:48:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 234. [2023-11-06 22:48:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 192 states have (on average 1.2864583333333333) internal successors, (247), 194 states have internal predecessors, (247), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-06 22:48:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 321 transitions. [2023-11-06 22:48:27,563 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 321 transitions. Word has length 137 [2023-11-06 22:48:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:27,564 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 321 transitions. [2023-11-06 22:48:27,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 321 transitions. [2023-11-06 22:48:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 22:48:27,568 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:27,568 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:27,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:48:27,568 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:27,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:27,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1480064121, now seen corresponding path program 1 times [2023-11-06 22:48:27,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297947941] [2023-11-06 22:48:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297947941] [2023-11-06 22:48:28,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297947941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:28,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:28,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:48:28,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867825698] [2023-11-06 22:48:28,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:28,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:48:28,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:28,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:48:28,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:48:28,699 INFO L87 Difference]: Start difference. First operand 234 states and 321 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:29,707 INFO L93 Difference]: Finished difference Result 542 states and 745 transitions. [2023-11-06 22:48:29,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:29,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2023-11-06 22:48:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:29,711 INFO L225 Difference]: With dead ends: 542 [2023-11-06 22:48:29,711 INFO L226 Difference]: Without dead ends: 336 [2023-11-06 22:48:29,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:48:29,713 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 213 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:29,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 546 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:48:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-11-06 22:48:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 234. [2023-11-06 22:48:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 192 states have (on average 1.28125) internal successors, (246), 194 states have internal predecessors, (246), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-06 22:48:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 320 transitions. [2023-11-06 22:48:29,793 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 320 transitions. Word has length 138 [2023-11-06 22:48:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:29,794 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 320 transitions. [2023-11-06 22:48:29,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 320 transitions. [2023-11-06 22:48:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:48:29,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:29,796 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:29,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:48:29,797 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:29,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:29,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1196433895, now seen corresponding path program 1 times [2023-11-06 22:48:29,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:29,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192513262] [2023-11-06 22:48:29,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:30,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192513262] [2023-11-06 22:48:30,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192513262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:30,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:30,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:48:30,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997428500] [2023-11-06 22:48:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:30,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:48:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:48:30,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:48:30,836 INFO L87 Difference]: Start difference. First operand 234 states and 320 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:31,455 INFO L93 Difference]: Finished difference Result 474 states and 647 transitions. [2023-11-06 22:48:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:48:31,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2023-11-06 22:48:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:31,458 INFO L225 Difference]: With dead ends: 474 [2023-11-06 22:48:31,458 INFO L226 Difference]: Without dead ends: 268 [2023-11-06 22:48:31,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:48:31,460 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 310 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:31,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 366 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:48:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-11-06 22:48:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 229. [2023-11-06 22:48:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 187 states have (on average 1.267379679144385) internal successors, (237), 189 states have internal predecessors, (237), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-06 22:48:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 311 transitions. [2023-11-06 22:48:31,514 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 311 transitions. Word has length 139 [2023-11-06 22:48:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:31,515 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 311 transitions. [2023-11-06 22:48:31,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 311 transitions. [2023-11-06 22:48:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:48:31,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:31,518 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:31,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:48:31,518 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:31,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:31,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1518630787, now seen corresponding path program 1 times [2023-11-06 22:48:31,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:31,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905825920] [2023-11-06 22:48:31,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:34,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:34,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:34,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:34,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905825920] [2023-11-06 22:48:34,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905825920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:34,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:34,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:48:34,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910668994] [2023-11-06 22:48:34,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:34,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:48:34,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:48:34,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:48:34,083 INFO L87 Difference]: Start difference. First operand 229 states and 311 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:35,151 INFO L93 Difference]: Finished difference Result 567 states and 766 transitions. [2023-11-06 22:48:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:48:35,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2023-11-06 22:48:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:35,155 INFO L225 Difference]: With dead ends: 567 [2023-11-06 22:48:35,155 INFO L226 Difference]: Without dead ends: 366 [2023-11-06 22:48:35,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:48:35,157 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 365 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:35,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 592 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:48:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-11-06 22:48:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 256. [2023-11-06 22:48:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 214 states have (on average 1.2616822429906542) internal successors, (270), 216 states have internal predecessors, (270), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-06 22:48:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 344 transitions. [2023-11-06 22:48:35,221 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 344 transitions. Word has length 139 [2023-11-06 22:48:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:35,222 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 344 transitions. [2023-11-06 22:48:35,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 344 transitions. [2023-11-06 22:48:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:48:35,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:35,225 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:35,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:48:35,225 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:35,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:35,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1726635469, now seen corresponding path program 1 times [2023-11-06 22:48:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:35,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462366986] [2023-11-06 22:48:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:35,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:37,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462366986] [2023-11-06 22:48:37,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462366986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:37,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:37,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:48:37,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377511761] [2023-11-06 22:48:37,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:37,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:48:37,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:37,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:48:37,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:48:37,610 INFO L87 Difference]: Start difference. First operand 256 states and 344 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-06 22:48:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:38,496 INFO L93 Difference]: Finished difference Result 584 states and 783 transitions. [2023-11-06 22:48:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:48:38,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2023-11-06 22:48:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:38,502 INFO L225 Difference]: With dead ends: 584 [2023-11-06 22:48:38,503 INFO L226 Difference]: Without dead ends: 356 [2023-11-06 22:48:38,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:48:38,505 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 486 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:38,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 294 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 22:48:38,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-11-06 22:48:38,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 314. [2023-11-06 22:48:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 263 states have (on average 1.258555133079848) internal successors, (331), 266 states have internal predecessors, (331), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-06 22:48:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 421 transitions. [2023-11-06 22:48:38,604 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 421 transitions. Word has length 139 [2023-11-06 22:48:38,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:38,606 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 421 transitions. [2023-11-06 22:48:38,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-06 22:48:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 421 transitions. [2023-11-06 22:48:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:48:38,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:38,609 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:38,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:48:38,609 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:38,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:38,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1795173346, now seen corresponding path program 1 times [2023-11-06 22:48:38,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:38,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770491611] [2023-11-06 22:48:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:38,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:40,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:40,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770491611] [2023-11-06 22:48:40,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770491611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:40,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:40,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:48:40,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151536213] [2023-11-06 22:48:40,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:40,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:48:40,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:40,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:48:40,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:48:40,682 INFO L87 Difference]: Start difference. First operand 314 states and 421 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:42,260 INFO L93 Difference]: Finished difference Result 737 states and 987 transitions. [2023-11-06 22:48:42,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:48:42,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-11-06 22:48:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:42,265 INFO L225 Difference]: With dead ends: 737 [2023-11-06 22:48:42,265 INFO L226 Difference]: Without dead ends: 451 [2023-11-06 22:48:42,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:48:42,268 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 485 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:42,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 923 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:48:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-11-06 22:48:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 330. [2023-11-06 22:48:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 279 states have (on average 1.2508960573476702) internal successors, (349), 282 states have internal predecessors, (349), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-06 22:48:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 439 transitions. [2023-11-06 22:48:42,384 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 439 transitions. Word has length 140 [2023-11-06 22:48:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:42,385 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 439 transitions. [2023-11-06 22:48:42,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 439 transitions. [2023-11-06 22:48:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:48:42,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:42,388 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:42,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:48:42,388 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:42,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 911446048, now seen corresponding path program 1 times [2023-11-06 22:48:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:42,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228272412] [2023-11-06 22:48:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:43,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:43,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228272412] [2023-11-06 22:48:43,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228272412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:43,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:43,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:48:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561614887] [2023-11-06 22:48:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:43,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:48:43,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:43,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:48:43,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:48:43,302 INFO L87 Difference]: Start difference. First operand 330 states and 439 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:44,070 INFO L93 Difference]: Finished difference Result 772 states and 1022 transitions. [2023-11-06 22:48:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:48:44,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-11-06 22:48:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:44,074 INFO L225 Difference]: With dead ends: 772 [2023-11-06 22:48:44,075 INFO L226 Difference]: Without dead ends: 470 [2023-11-06 22:48:44,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:48:44,076 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 337 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:44,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 652 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:48:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-11-06 22:48:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 362. [2023-11-06 22:48:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 311 states have (on average 1.2508038585209003) internal successors, (389), 314 states have internal predecessors, (389), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-06 22:48:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 479 transitions. [2023-11-06 22:48:44,188 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 479 transitions. Word has length 140 [2023-11-06 22:48:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:44,188 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 479 transitions. [2023-11-06 22:48:44,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 479 transitions. [2023-11-06 22:48:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:48:44,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:44,192 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:44,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:48:44,192 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:44,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:44,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1372471520, now seen corresponding path program 1 times [2023-11-06 22:48:44,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:44,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925416692] [2023-11-06 22:48:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:44,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:44,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:44,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925416692] [2023-11-06 22:48:44,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925416692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:44,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:44,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:48:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168693903] [2023-11-06 22:48:44,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:44,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:48:44,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:44,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:48:44,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:48:44,869 INFO L87 Difference]: Start difference. First operand 362 states and 479 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:45,610 INFO L93 Difference]: Finished difference Result 688 states and 913 transitions. [2023-11-06 22:48:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:45,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2023-11-06 22:48:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:45,614 INFO L225 Difference]: With dead ends: 688 [2023-11-06 22:48:45,614 INFO L226 Difference]: Without dead ends: 354 [2023-11-06 22:48:45,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:48:45,618 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 141 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:45,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 405 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:48:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-11-06 22:48:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2023-11-06 22:48:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 303 states have (on average 1.2508250825082508) internal successors, (379), 306 states have internal predecessors, (379), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-06 22:48:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 469 transitions. [2023-11-06 22:48:45,733 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 469 transitions. Word has length 140 [2023-11-06 22:48:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:45,733 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 469 transitions. [2023-11-06 22:48:45,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 469 transitions. [2023-11-06 22:48:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:48:45,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:45,736 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:45,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:48:45,737 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:45,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:45,737 INFO L85 PathProgramCache]: Analyzing trace with hash 401972958, now seen corresponding path program 1 times [2023-11-06 22:48:45,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:45,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643474104] [2023-11-06 22:48:45,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:45,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:46,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:46,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643474104] [2023-11-06 22:48:46,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643474104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:46,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:46,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:48:46,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862280144] [2023-11-06 22:48:46,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:46,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:48:46,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:46,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:48:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:48:46,839 INFO L87 Difference]: Start difference. First operand 354 states and 469 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:47,800 INFO L93 Difference]: Finished difference Result 725 states and 959 transitions. [2023-11-06 22:48:47,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:48:47,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2023-11-06 22:48:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:47,804 INFO L225 Difference]: With dead ends: 725 [2023-11-06 22:48:47,804 INFO L226 Difference]: Without dead ends: 399 [2023-11-06 22:48:47,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:48:47,806 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 377 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:47,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 461 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:48:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-11-06 22:48:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 346. [2023-11-06 22:48:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 295 states have (on average 1.2440677966101694) internal successors, (367), 298 states have internal predecessors, (367), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-06 22:48:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 457 transitions. [2023-11-06 22:48:47,920 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 457 transitions. Word has length 140 [2023-11-06 22:48:47,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:47,921 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 457 transitions. [2023-11-06 22:48:47,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 457 transitions. [2023-11-06 22:48:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:48:47,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:47,924 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:47,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:48:47,924 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:47,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1881944610, now seen corresponding path program 1 times [2023-11-06 22:48:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:47,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557647958] [2023-11-06 22:48:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:48,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557647958] [2023-11-06 22:48:48,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557647958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:48,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:48,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:48:48,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364731563] [2023-11-06 22:48:48,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:48,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:48:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:48,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:48:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:48:48,749 INFO L87 Difference]: Start difference. First operand 346 states and 457 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:49,229 INFO L93 Difference]: Finished difference Result 693 states and 917 transitions. [2023-11-06 22:48:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:49,230 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-11-06 22:48:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:49,232 INFO L225 Difference]: With dead ends: 693 [2023-11-06 22:48:49,233 INFO L226 Difference]: Without dead ends: 375 [2023-11-06 22:48:49,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:48:49,234 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 206 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:49,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 371 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:48:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-11-06 22:48:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 314. [2023-11-06 22:48:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 263 states have (on average 1.2357414448669202) internal successors, (325), 266 states have internal predecessors, (325), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-06 22:48:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 415 transitions. [2023-11-06 22:48:49,343 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 415 transitions. Word has length 140 [2023-11-06 22:48:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:49,344 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 415 transitions. [2023-11-06 22:48:49,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 415 transitions. [2023-11-06 22:48:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:48:49,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:49,347 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:49,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:48:49,347 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:49,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash -243526508, now seen corresponding path program 1 times [2023-11-06 22:48:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266486153] [2023-11-06 22:48:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:50,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:48:51,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:51,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266486153] [2023-11-06 22:48:51,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266486153] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:48:51,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555237706] [2023-11-06 22:48:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:51,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:51,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:51,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:48:51,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:48:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:51,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:48:51,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:51,423 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:48:51,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2023-11-06 22:48:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:51,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:51,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555237706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:51,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:48:51,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2023-11-06 22:48:51,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24287612] [2023-11-06 22:48:51,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:51,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:51,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:51,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:51,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:48:51,458 INFO L87 Difference]: Start difference. First operand 314 states and 415 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:51,822 INFO L93 Difference]: Finished difference Result 714 states and 943 transitions. [2023-11-06 22:48:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:48:51,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-11-06 22:48:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:51,829 INFO L225 Difference]: With dead ends: 714 [2023-11-06 22:48:51,829 INFO L226 Difference]: Without dead ends: 428 [2023-11-06 22:48:51,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:48:51,831 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 82 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:51,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 563 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:48:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-11-06 22:48:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 321. [2023-11-06 22:48:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 270 states have (on average 1.2333333333333334) internal successors, (333), 273 states have internal predecessors, (333), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-06 22:48:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 423 transitions. [2023-11-06 22:48:51,935 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 423 transitions. Word has length 140 [2023-11-06 22:48:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:51,936 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 423 transitions. [2023-11-06 22:48:51,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:48:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 423 transitions. [2023-11-06 22:48:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:48:51,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:51,939 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:51,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:52,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 22:48:52,146 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:52,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1573683125, now seen corresponding path program 1 times [2023-11-06 22:48:52,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:52,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195012547] [2023-11-06 22:48:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:52,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:48:53,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195012547] [2023-11-06 22:48:53,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195012547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:53,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:53,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 22:48:53,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098663884] [2023-11-06 22:48:53,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:53,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:48:53,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:53,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:48:53,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:48:53,475 INFO L87 Difference]: Start difference. First operand 321 states and 423 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:55,008 INFO L93 Difference]: Finished difference Result 458 states and 611 transitions. [2023-11-06 22:48:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:48:55,009 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2023-11-06 22:48:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:55,012 INFO L225 Difference]: With dead ends: 458 [2023-11-06 22:48:55,012 INFO L226 Difference]: Without dead ends: 456 [2023-11-06 22:48:55,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:48:55,015 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 410 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:55,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 674 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:48:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-11-06 22:48:55,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 355. [2023-11-06 22:48:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 304 states have (on average 1.25) internal successors, (380), 307 states have internal predecessors, (380), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2023-11-06 22:48:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 470 transitions. [2023-11-06 22:48:55,141 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 470 transitions. Word has length 140 [2023-11-06 22:48:55,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:55,142 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 470 transitions. [2023-11-06 22:48:55,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:48:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 470 transitions. [2023-11-06 22:48:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:48:55,144 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:55,144 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:55,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:48:55,144 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:55,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:55,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1575530167, now seen corresponding path program 1 times [2023-11-06 22:48:55,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:55,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024648111] [2023-11-06 22:48:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:48:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:48:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:48:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:48:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:48:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:48:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:48:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:48:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:48:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:57,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:48:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:48:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:48:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:48:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:48:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024648111] [2023-11-06 22:48:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024648111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:48:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20493381] [2023-11-06 22:48:57,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:57,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:48:57,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:57,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:48:57,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:48:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:57,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-06 22:48:57,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:01,315 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:49:02,344 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 13 [2023-11-06 22:49:03,013 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 13 [2023-11-06 22:49:03,671 INFO L322 Elim1Store]: treesize reduction 86, result has 28.9 percent of original size [2023-11-06 22:49:03,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 99 [2023-11-06 22:49:03,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:03,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:03,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:03,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:03,917 INFO L322 Elim1Store]: treesize reduction 86, result has 28.3 percent of original size [2023-11-06 22:49:03,917 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 106 [2023-11-06 22:49:04,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:04,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:04,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:04,249 INFO L322 Elim1Store]: treesize reduction 282, result has 16.6 percent of original size [2023-11-06 22:49:04,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 284 treesize of output 302 [2023-11-06 22:49:07,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:07,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:07,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:08,038 INFO L322 Elim1Store]: treesize reduction 453, result has 13.5 percent of original size [2023-11-06 22:49:08,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 152 treesize of output 253 [2023-11-06 22:49:08,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 170 treesize of output 146 [2023-11-06 22:49:08,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:08,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:08,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:08,496 INFO L322 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-11-06 22:49:08,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 74 [2023-11-06 22:49:08,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:08,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:08,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:08,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:08,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:08,627 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:08,660 INFO L322 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-06 22:49:08,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 66 [2023-11-06 22:49:09,565 INFO L322 Elim1Store]: treesize reduction 44, result has 15.4 percent of original size [2023-11-06 22:49:09,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 37 [2023-11-06 22:49:09,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 24 [2023-11-06 22:49:09,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:09,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:09,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:09,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:10,093 INFO L322 Elim1Store]: treesize reduction 148, result has 26.7 percent of original size [2023-11-06 22:49:10,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 126 [2023-11-06 22:49:10,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:10,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:10,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:10,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:10,546 INFO L322 Elim1Store]: treesize reduction 498, result has 12.0 percent of original size [2023-11-06 22:49:10,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 166 treesize of output 264 [2023-11-06 22:49:11,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:11,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:11,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:11,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:11,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:11,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:11,213 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:11,222 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:49:11,222 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 95 [2023-11-06 22:49:12,943 INFO L322 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-06 22:49:12,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 79 [2023-11-06 22:49:13,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:13,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:13,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:13,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:13,361 INFO L322 Elim1Store]: treesize reduction 498, result has 12.0 percent of original size [2023-11-06 22:49:13,361 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 166 treesize of output 264 [2023-11-06 22:49:13,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:13,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:13,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:13,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:13,485 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:13,499 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:13,500 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 68 [2023-11-06 22:49:13,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:13,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:13,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:13,647 INFO L322 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-11-06 22:49:13,647 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 76 [2023-11-06 22:49:14,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:14,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:14,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:15,090 INFO L322 Elim1Store]: treesize reduction 812, result has 15.6 percent of original size [2023-11-06 22:49:15,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 4 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 60 case distinctions, treesize of input 197 treesize of output 273 [2023-11-06 22:49:19,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 88 treesize of output 67 [2023-11-06 22:49:19,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,348 INFO L322 Elim1Store]: treesize reduction 309, result has 18.7 percent of original size [2023-11-06 22:49:19,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 175 treesize of output 272 [2023-11-06 22:49:19,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:19,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:19,469 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:49:19,470 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 65 [2023-11-06 22:49:19,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:19,634 INFO L322 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-11-06 22:49:19,634 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 73 [2023-11-06 22:49:20,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:20,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:20,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:20,183 INFO L322 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-11-06 22:49:20,183 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 73 [2023-11-06 22:49:20,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:20,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:20,252 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:20,270 INFO L322 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-06 22:49:20,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 41 [2023-11-06 22:49:20,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:20,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:20,319 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:20,325 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 27 [2023-11-06 22:49:20,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 3585 treesize of output 3054 [2023-11-06 22:49:21,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,527 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:49:21,527 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 65 [2023-11-06 22:49:21,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,609 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:21,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,617 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:21,620 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 41 [2023-11-06 22:49:21,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,737 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:21,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:21,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2023-11-06 22:49:21,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:21,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,810 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:49:21,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2023-11-06 22:49:21,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:21,865 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-06 22:49:21,865 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 136 [2023-11-06 22:49:22,283 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 22:49:22,283 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 74 [2023-11-06 22:49:22,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:22,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:22,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:22,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:22,676 INFO L322 Elim1Store]: treesize reduction 512, result has 9.5 percent of original size [2023-11-06 22:49:22,677 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 166 treesize of output 250 [2023-11-06 22:49:23,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:23,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:23,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:23,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:23,168 INFO L322 Elim1Store]: treesize reduction 98, result has 21.0 percent of original size [2023-11-06 22:49:23,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 741 treesize of output 736 [2023-11-06 22:49:25,466 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 21 treesize of output 20 [2023-11-06 22:49:25,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:25,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:25,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:49:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 183 proven. 73 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-11-06 22:49:25,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:26,242 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base))) (and (forall ((v_ArrVal_1566 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (or (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1564 (Array Int Int)) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1564) c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_1566))) (store .cse2 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (select (select .cse2 ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset)))))) (or (forall ((v_ArrVal_1570 Int)) (< 0 (mod (select (select (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1570))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (not (= (mod (select (select .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset) 256) 0))))) (not (= v_ArrVal_1566 (store (select (store |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset))) c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_1566 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))))) (forall ((v_ArrVal_1566 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (or (forall ((~WrapperStruct00_var_1_12_Pointer~0.offset Int) (v_ArrVal_1564 (Array Int Int)) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse5 (let ((.cse6 (store (store |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1564) c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_1566))) (store .cse6 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (select (select .cse6 ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset)))))) (or (forall ((v_ArrVal_1570 Int)) (< 0 (mod (select (select (let ((.cse4 (store .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1570))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (= (mod (select (select .cse5 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset) 256) 0)))) (not (= v_ArrVal_1566 (store (select (store |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset))) c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_1566 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))))))) is different from false [2023-11-06 22:49:26,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20493381] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:26,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:49:26,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2023-11-06 22:49:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594761264] [2023-11-06 22:49:26,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:26,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 22:49:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:26,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 22:49:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2023-11-06 22:49:26,357 INFO L87 Difference]: Start difference. First operand 355 states and 470 transitions. Second operand has 25 states, 23 states have (on average 4.608695652173913) internal successors, (106), 25 states have internal predecessors, (106), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2023-11-06 22:49:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:29,671 INFO L93 Difference]: Finished difference Result 770 states and 1009 transitions. [2023-11-06 22:49:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:49:29,673 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.608695652173913) internal successors, (106), 25 states have internal predecessors, (106), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) Word has length 140 [2023-11-06 22:49:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:29,677 INFO L225 Difference]: With dead ends: 770 [2023-11-06 22:49:29,677 INFO L226 Difference]: Without dead ends: 443 [2023-11-06 22:49:29,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=415, Invalid=1750, Unknown=1, NotChecked=90, Total=2256 [2023-11-06 22:49:29,680 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 564 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:29,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 827 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-06 22:49:29,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-11-06 22:49:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 393. [2023-11-06 22:49:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 333 states have (on average 1.2402402402402402) internal successors, (413), 336 states have internal predecessors, (413), 50 states have call successors, (50), 9 states have call predecessors, (50), 9 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-06 22:49:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 513 transitions. [2023-11-06 22:49:29,837 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 513 transitions. Word has length 140 [2023-11-06 22:49:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:29,837 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 513 transitions. [2023-11-06 22:49:29,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.608695652173913) internal successors, (106), 25 states have internal predecessors, (106), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2023-11-06 22:49:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 513 transitions. [2023-11-06 22:49:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:49:29,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:29,839 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:29,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:30,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 22:49:30,047 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:30,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:30,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1066057077, now seen corresponding path program 1 times [2023-11-06 22:49:30,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:30,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065999630] [2023-11-06 22:49:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:49:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:49:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:49:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:49:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:49:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:49:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:49:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:49:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:49:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:49:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:49:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:49:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:49:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:49:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:49:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:49:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:30,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065999630] [2023-11-06 22:49:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065999630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:30,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:30,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:49:30,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254358931] [2023-11-06 22:49:30,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:30,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:49:30,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:30,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:49:30,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:49:30,761 INFO L87 Difference]: Start difference. First operand 393 states and 513 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:49:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:31,268 INFO L93 Difference]: Finished difference Result 822 states and 1067 transitions. [2023-11-06 22:49:31,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:49:31,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2023-11-06 22:49:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:31,272 INFO L225 Difference]: With dead ends: 822 [2023-11-06 22:49:31,272 INFO L226 Difference]: Without dead ends: 463 [2023-11-06 22:49:31,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:49:31,274 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 251 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:31,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 361 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:49:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-11-06 22:49:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 393. [2023-11-06 22:49:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 333 states have (on average 1.2372372372372373) internal successors, (412), 336 states have internal predecessors, (412), 50 states have call successors, (50), 9 states have call predecessors, (50), 9 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-06 22:49:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 512 transitions. [2023-11-06 22:49:31,459 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 512 transitions. Word has length 140 [2023-11-06 22:49:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:31,460 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 512 transitions. [2023-11-06 22:49:31,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-06 22:49:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 512 transitions. [2023-11-06 22:49:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:49:31,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:31,462 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:31,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:49:31,463 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:31,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:31,463 INFO L85 PathProgramCache]: Analyzing trace with hash 479251063, now seen corresponding path program 1 times [2023-11-06 22:49:31,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:31,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436869085] [2023-11-06 22:49:31,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:31,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:49:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:49:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:49:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:49:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:49:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:49:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:49:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:49:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:49:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:32,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:49:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:33,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:49:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:33,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:49:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:33,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:49:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:33,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:49:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:49:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:49:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:33,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436869085] [2023-11-06 22:49:33,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436869085] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:33,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712485932] [2023-11-06 22:49:33,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:33,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:33,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:33,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:49:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:33,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-06 22:49:33,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:35,282 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:49:35,981 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 13 [2023-11-06 22:49:36,521 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 13 [2023-11-06 22:49:37,033 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 13 [2023-11-06 22:49:37,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,340 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 13 [2023-11-06 22:49:37,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,357 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 32 treesize of output 13 [2023-11-06 22:49:37,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,375 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 32 treesize of output 13 [2023-11-06 22:49:37,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,398 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 39 treesize of output 13 [2023-11-06 22:49:37,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,412 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 13 [2023-11-06 22:49:37,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:37,427 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 32 treesize of output 13 [2023-11-06 22:49:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 235 proven. 79 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-11-06 22:49:37,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:37,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712485932] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:37,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:49:37,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-11-06 22:49:37,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174500914] [2023-11-06 22:49:37,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:37,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 22:49:37,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:37,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 22:49:37,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:49:37,608 INFO L87 Difference]: Start difference. First operand 393 states and 512 transitions. Second operand has 18 states, 16 states have (on average 6.25) internal successors, (100), 18 states have internal predecessors, (100), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2023-11-06 22:49:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:38,791 INFO L93 Difference]: Finished difference Result 701 states and 910 transitions. [2023-11-06 22:49:38,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:49:38,792 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 18 states have internal predecessors, (100), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) Word has length 140 [2023-11-06 22:49:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:38,795 INFO L225 Difference]: With dead ends: 701 [2023-11-06 22:49:38,795 INFO L226 Difference]: Without dead ends: 342 [2023-11-06 22:49:38,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2023-11-06 22:49:38,798 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 110 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:38,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 646 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:49:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-06 22:49:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 334. [2023-11-06 22:49:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 275 states have (on average 1.2145454545454546) internal successors, (334), 278 states have internal predecessors, (334), 49 states have call successors, (49), 9 states have call predecessors, (49), 9 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2023-11-06 22:49:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 432 transitions. [2023-11-06 22:49:38,916 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 432 transitions. Word has length 140 [2023-11-06 22:49:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:38,917 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 432 transitions. [2023-11-06 22:49:38,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 18 states have internal predecessors, (100), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2023-11-06 22:49:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 432 transitions. [2023-11-06 22:49:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-06 22:49:38,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:38,919 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:38,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:39,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-06 22:49:39,126 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:39,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash -310353075, now seen corresponding path program 1 times [2023-11-06 22:49:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:39,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917095986] [2023-11-06 22:49:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:39,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:49:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:49:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:49:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:49:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:49:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:49:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:49:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:49:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:49:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:49:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:49:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:49:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:49:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:49:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:49:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:49:41,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:41,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917095986] [2023-11-06 22:49:41,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917095986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:41,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:41,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:49:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522166492] [2023-11-06 22:49:41,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:41,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:49:41,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:41,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:49:41,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:49:41,762 INFO L87 Difference]: Start difference. First operand 334 states and 432 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:49:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:43,044 INFO L93 Difference]: Finished difference Result 959 states and 1248 transitions. [2023-11-06 22:49:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:49:43,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-11-06 22:49:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:43,049 INFO L225 Difference]: With dead ends: 959 [2023-11-06 22:49:43,049 INFO L226 Difference]: Without dead ends: 653 [2023-11-06 22:49:43,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:49:43,051 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 310 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:43,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 831 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-06 22:49:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2023-11-06 22:49:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 602. [2023-11-06 22:49:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 498 states have (on average 1.2349397590361446) internal successors, (615), 503 states have internal predecessors, (615), 87 states have call successors, (87), 16 states have call predecessors, (87), 16 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2023-11-06 22:49:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 789 transitions. [2023-11-06 22:49:43,275 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 789 transitions. Word has length 143 [2023-11-06 22:49:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:43,275 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 789 transitions. [2023-11-06 22:49:43,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:49:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 789 transitions. [2023-11-06 22:49:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-06 22:49:43,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:43,278 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:43,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-06 22:49:43,278 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:43,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash -248313461, now seen corresponding path program 1 times [2023-11-06 22:49:43,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:43,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558047034] [2023-11-06 22:49:43,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:49:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:49:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:49:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:49:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:49:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:49:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:49:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:49:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:49:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:49:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:49:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:49:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:49:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:49:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:49:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:49:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:49:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-06 22:49:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:46,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558047034] [2023-11-06 22:49:46,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558047034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:46,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541926705] [2023-11-06 22:49:46,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:46,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:49:46,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:46,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:49:46,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:49:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:47,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-06 22:49:47,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:49:47,426 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 23 treesize of output 11 [2023-11-06 22:49:48,104 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 23 treesize of output 11 [2023-11-06 22:49:48,750 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 23 treesize of output 11 [2023-11-06 22:49:49,388 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 23 treesize of output 11 [2023-11-06 22:49:50,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 23 treesize of output 11 [2023-11-06 22:49:51,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:49:51,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:49:52,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:49:53,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:49:53,880 INFO L322 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-11-06 22:49:53,880 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 49 [2023-11-06 22:49:53,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,951 INFO L322 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-06 22:49:53,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2023-11-06 22:49:53,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:53,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,025 INFO L322 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2023-11-06 22:49:54,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 50 [2023-11-06 22:49:54,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,094 INFO L322 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-06 22:49:54,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2023-11-06 22:49:54,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 60 treesize of output 40 [2023-11-06 22:49:54,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,265 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 74 [2023-11-06 22:49:54,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,313 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2023-11-06 22:49:54,773 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 85 treesize of output 61 [2023-11-06 22:49:54,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:49:54,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2023-11-06 22:49:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 249 proven. 82 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2023-11-06 22:49:54,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:49:55,169 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base))) (and (forall ((v_ArrVal_1930 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (or (forall ((v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1933 Int)) (let ((.cse0 (store (store |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1932) c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_1930))) (or (< (select (select .cse0 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset) v_ArrVal_1933) (let ((.cse1 (let ((.cse2 (store .cse0 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset v_ArrVal_1933)))) (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0))))) (< (select (select .cse1 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset) (select (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset)))))) (not (= v_ArrVal_1930 (store (select (store |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset))) c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_1930 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))))) (forall ((v_ArrVal_1930 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (or (forall ((v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1933 Int)) (let ((.cse4 (store (store |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_1932) c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_1930))) (or (< (select (select .cse4 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset) v_ArrVal_1933) (let ((.cse5 (let ((.cse6 (store .cse4 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset v_ArrVal_1933)))) (store .cse6 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1))))) (< (select (select .cse5 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset) (select (select .cse5 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset)))))) (not (= v_ArrVal_1930 (store (select (store |c_#memory_int| c_~WrapperStruct00_var_1_18_Pointer~0.base (store .cse3 c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select |c_#memory_int| ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset))) c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_1930 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))))))) is different from false [2023-11-06 22:49:55,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541926705] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:49:55,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:49:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 24 [2023-11-06 22:49:55,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598816223] [2023-11-06 22:49:55,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:49:55,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 22:49:55,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:55,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 22:49:55,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=624, Unknown=1, NotChecked=50, Total=756 [2023-11-06 22:49:55,296 INFO L87 Difference]: Start difference. First operand 602 states and 789 transitions. Second operand has 24 states, 21 states have (on average 5.428571428571429) internal successors, (114), 24 states have internal predecessors, (114), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) [2023-11-06 22:49:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:58,584 INFO L93 Difference]: Finished difference Result 1246 states and 1632 transitions. [2023-11-06 22:49:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:49:58,585 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.428571428571429) internal successors, (114), 24 states have internal predecessors, (114), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) Word has length 143 [2023-11-06 22:49:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:58,589 INFO L225 Difference]: With dead ends: 1246 [2023-11-06 22:49:58,589 INFO L226 Difference]: Without dead ends: 678 [2023-11-06 22:49:58,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=271, Invalid=1454, Unknown=1, NotChecked=80, Total=1806 [2023-11-06 22:49:58,593 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 209 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:58,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 923 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 22:49:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2023-11-06 22:49:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 650. [2023-11-06 22:49:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 536 states have (on average 1.2350746268656716) internal successors, (662), 540 states have internal predecessors, (662), 93 states have call successors, (93), 20 states have call predecessors, (93), 20 states have return successors, (93), 89 states have call predecessors, (93), 93 states have call successors, (93) [2023-11-06 22:49:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 848 transitions. [2023-11-06 22:49:58,808 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 848 transitions. Word has length 143 [2023-11-06 22:49:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:58,809 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 848 transitions. [2023-11-06 22:49:58,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.428571428571429) internal successors, (114), 24 states have internal predecessors, (114), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) [2023-11-06 22:49:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 848 transitions. [2023-11-06 22:49:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-06 22:49:58,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:58,811 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:58,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:49:59,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-06 22:49:59,018 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:59,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:59,018 INFO L85 PathProgramCache]: Analyzing trace with hash 282022606, now seen corresponding path program 1 times [2023-11-06 22:49:59,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:59,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587872287] [2023-11-06 22:49:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:50:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:50:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:50:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:50:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:50:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:50:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:50:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:50:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:50:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:50:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:50:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:50:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:50:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:50:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:50:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:50:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 22:50:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-06 22:50:00,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587872287] [2023-11-06 22:50:00,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587872287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:00,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:00,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-06 22:50:00,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320441529] [2023-11-06 22:50:00,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:00,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:50:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:00,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:50:00,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:50:00,600 INFO L87 Difference]: Start difference. First operand 650 states and 848 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:50:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:01,986 INFO L93 Difference]: Finished difference Result 925 states and 1240 transitions. [2023-11-06 22:50:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:50:01,987 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-11-06 22:50:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:01,993 INFO L225 Difference]: With dead ends: 925 [2023-11-06 22:50:01,994 INFO L226 Difference]: Without dead ends: 923 [2023-11-06 22:50:01,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:50:01,995 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 372 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:01,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 480 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:50:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-11-06 22:50:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 668. [2023-11-06 22:50:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 554 states have (on average 1.227436823104693) internal successors, (680), 558 states have internal predecessors, (680), 93 states have call successors, (93), 20 states have call predecessors, (93), 20 states have return successors, (93), 89 states have call predecessors, (93), 93 states have call successors, (93) [2023-11-06 22:50:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 866 transitions. [2023-11-06 22:50:02,291 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 866 transitions. Word has length 143 [2023-11-06 22:50:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:02,291 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 866 transitions. [2023-11-06 22:50:02,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-06 22:50:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 866 transitions. [2023-11-06 22:50:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-06 22:50:02,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:02,293 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:02,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 22:50:02,294 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:02,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash 283869648, now seen corresponding path program 1 times [2023-11-06 22:50:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:02,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909710387] [2023-11-06 22:50:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:02,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:02,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:50:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:50:02,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:50:02,813 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:50:02,815 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:50:02,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 22:50:02,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:02,824 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:50:03,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:50:03 BoogieIcfgContainer [2023-11-06 22:50:03,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:50:03,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:50:03,026 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:50:03,027 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:50:03,027 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:53" (3/4) ... [2023-11-06 22:50:03,029 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:50:03,030 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:50:03,030 INFO L158 Benchmark]: Toolchain (without parser) took 130929.86ms. Allocated memory was 127.9MB in the beginning and 847.2MB in the end (delta: 719.3MB). Free memory was 83.8MB in the beginning and 534.1MB in the end (delta: -450.4MB). Peak memory consumption was 271.9MB. Max. memory is 16.1GB. [2023-11-06 22:50:03,031 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 127.9MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:50:03,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.66ms. Allocated memory is still 127.9MB. Free memory was 83.3MB in the beginning and 68.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:50:03,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.33ms. Allocated memory is still 127.9MB. Free memory was 68.2MB in the beginning and 64.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:50:03,031 INFO L158 Benchmark]: Boogie Preprocessor took 84.64ms. Allocated memory is still 127.9MB. Free memory was 64.9MB in the beginning and 62.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:50:03,032 INFO L158 Benchmark]: RCFGBuilder took 932.27ms. Allocated memory was 127.9MB in the beginning and 159.4MB in the end (delta: 31.5MB). Free memory was 62.3MB in the beginning and 116.1MB in the end (delta: -53.7MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2023-11-06 22:50:03,032 INFO L158 Benchmark]: TraceAbstraction took 129373.85ms. Allocated memory was 159.4MB in the beginning and 847.2MB in the end (delta: 687.9MB). Free memory was 116.1MB in the beginning and 534.1MB in the end (delta: -418.1MB). Peak memory consumption was 270.4MB. Max. memory is 16.1GB. [2023-11-06 22:50:03,032 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 847.2MB. Free memory is still 534.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:50:03,033 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.30ms. Allocated memory is still 127.9MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.66ms. Allocated memory is still 127.9MB. Free memory was 83.3MB in the beginning and 68.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.33ms. Allocated memory is still 127.9MB. Free memory was 68.2MB in the beginning and 64.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.64ms. Allocated memory is still 127.9MB. Free memory was 64.9MB in the beginning and 62.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 932.27ms. Allocated memory was 127.9MB in the beginning and 159.4MB in the end (delta: 31.5MB). Free memory was 62.3MB in the beginning and 116.1MB in the end (delta: -53.7MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 129373.85ms. Allocated memory was 159.4MB in the beginning and 847.2MB in the end (delta: 687.9MB). Free memory was 116.1MB in the beginning and 534.1MB in the end (delta: -418.1MB). Peak memory consumption was 270.4MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 847.2MB. Free memory is still 534.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L57] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] signed short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L59] signed short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L60] signed short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L61] signed char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] signed char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L63] signed char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L65] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L66] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L67] unsigned short int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] unsigned short int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L69] float* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L70] float* WrapperStruct00_var_1_21_Pointer = &(WrapperStruct00.var_1_21); [L71] signed short int* WrapperStruct00_var_1_22_Pointer = &(WrapperStruct00.var_1_22); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=0] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L105] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) VAL [WrapperStruct00.var_1_7=7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) VAL [WrapperStruct00.var_1_7=7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L108] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L109] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00.var_1_8=16383, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) VAL [WrapperStruct00.var_1_8=16383, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00.var_1_8=16383, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00.var_1_8=16383, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L111] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=5, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00.var_1_9=5, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=5, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00.var_1_9=5, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L114] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00.var_1_11=-7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00.var_1_11=-7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00.var_1_11=-7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00.var_1_11=-7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L117] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L118] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00.var_1_12=30, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00.var_1_12=30, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00.var_1_12=30, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) VAL [WrapperStruct00.var_1_12=30, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L120] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00.var_1_15=-511, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00.var_1_15=-511, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00.var_1_15=-511, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00.var_1_15=-511, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L123] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=-255, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00.var_1_16=-255, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=-255, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00.var_1_16=-255, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L126] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L127] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00.var_1_19=7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00.var_1_19=7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L128] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00.var_1_19=7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00.var_1_19=7, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L129] WrapperStruct00.var_1_21 = __VERIFIER_nondet_float() [L130] EXPR WrapperStruct00.var_1_21 [L130] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F [L130] EXPR WrapperStruct00.var_1_21 [L130] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00.var_1_21=20124, WrapperStruct00.var_1_21=20124, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L130] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )=1, WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F=1, WrapperStruct00.var_1_21=20124, WrapperStruct00.var_1_21=20124, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L130] CALL assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=1, cond=1, isInitial=1] [L130] RET assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )=1, WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F=1, WrapperStruct00.var_1_21=20124, WrapperStruct00.var_1_21=20124, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L143] RET updateVariables() [L144] CALL step() [L75] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L75] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L76] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_21_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L77] (*(WrapperStruct00_var_1_22_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_20_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_20_Pointer)=20124, isInitial=1] [L78] COND FALSE !(127.5f > (*(WrapperStruct00_var_1_20_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L81] EXPR ((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer)) VAL [((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_20_Pointer)=20124, \read(*WrapperStruct00_var_1_20_Pointer)=20124, isInitial=1] [L81] (*(WrapperStruct00_var_1_13_Pointer)) = (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))) [L83] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L83] COND TRUE (*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L84] (*(WrapperStruct00_var_1_10_Pointer)) = ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_13_Pointer)=1, isInitial=1] [L92] COND TRUE (*(WrapperStruct00_var_1_13_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L93] EXPR \read(*WrapperStruct00_var_1_22_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_22_Pointer)=30, isInitial=1] [L93] COND FALSE !((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) [L100] (*(WrapperStruct00_var_1_1_Pointer)) = 8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, isInitial=1] [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_13_Pointer)=1, isInitial=1] [L135] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1 [L135] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_22_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_22_Pointer)=30, isInitial=1] [L135] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) [L135] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L135] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8)) VAL [((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_22_Pointer)=30, isInitial=1] [L135] EXPR (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1 VAL [((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_22_Pointer)=30, isInitial=1] [L135] EXPR ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)) [L135] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_22_Pointer)=30, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L135] EXPR ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) [L135] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L135] EXPR ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) VAL [((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))=1, ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_11_Pointer)=-7, \read(*WrapperStruct00_var_1_12_Pointer)=30, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_22_Pointer)=30, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L135] EXPR ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)) VAL [((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))=1, ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_11_Pointer)=-7, \read(*WrapperStruct00_var_1_12_Pointer)=30, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_22_Pointer)=30, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L135] EXPR (((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer)))))) [L135] EXPR \read(*WrapperStruct00_var_1_20_Pointer) VAL [(((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))=1, ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))=1, ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_11_Pointer)=-7, \read(*WrapperStruct00_var_1_12_Pointer)=30, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_20_Pointer)=20124, \read(*WrapperStruct00_var_1_22_Pointer)=30, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L135] EXPR (127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))) [L135] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L135] EXPR (*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer)) [L135] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L135] EXPR (*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer)) VAL [(((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))=1, ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))=1, ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, (*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_11_Pointer)=-7, \read(*WrapperStruct00_var_1_12_Pointer)=30, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_15_Pointer)=-511, \read(*WrapperStruct00_var_1_16_Pointer)=-255, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_20_Pointer)=20124, \read(*WrapperStruct00_var_1_22_Pointer)=30, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L135] EXPR (127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))) VAL [(((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))=1, ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))=1, ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, (*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))=1, (127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer)))))=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_11_Pointer)=-7, \read(*WrapperStruct00_var_1_12_Pointer)=30, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_15_Pointer)=-511, \read(*WrapperStruct00_var_1_16_Pointer)=-255, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_20_Pointer)=20124, \read(*WrapperStruct00_var_1_22_Pointer)=30, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L135] EXPR (((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [(((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))=1, ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))=1, ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, (*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))=1, (127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer)))))=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_11_Pointer)=-7, \read(*WrapperStruct00_var_1_12_Pointer)=30, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_15_Pointer)=-511, \read(*WrapperStruct00_var_1_16_Pointer)=-255, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_20_Pointer)=20124, \read(*WrapperStruct00_var_1_22_Pointer)=30, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L135] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer)))) [L135] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L135] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))=1, (((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))=1, ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))=1, ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, (*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))=1, (127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer)))))=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_11_Pointer)=-7, \read(*WrapperStruct00_var_1_12_Pointer)=30, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_15_Pointer)=-511, \read(*WrapperStruct00_var_1_16_Pointer)=-255, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_19_Pointer)=7, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_20_Pointer)=20124, \read(*WrapperStruct00_var_1_22_Pointer)=30, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L135] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_21_Pointer)))) [L135] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L135] EXPR (((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_21_Pointer)))) VAL [((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))=1, (((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))=1, ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))=1, ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, (*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))=1, (127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer)))))=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_11_Pointer)=-7, \read(*WrapperStruct00_var_1_12_Pointer)=30, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_15_Pointer)=-511, \read(*WrapperStruct00_var_1_16_Pointer)=-255, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_19_Pointer)=7, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_20_Pointer)=20124, \read(*WrapperStruct00_var_1_20_Pointer)=20124, \read(*WrapperStruct00_var_1_21_Pointer)=20124, \read(*WrapperStruct00_var_1_22_Pointer)=30, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L135] EXPR ((((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_21_Pointer))))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [((((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_21_Pointer))))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_12_Pointer))))=0, (((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_21_Pointer))))=0, ((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))=1, (((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))=1, ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))=1, ((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))=1, ((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1)=1, (*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1=1, (*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))=1, (127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer)))))=1, WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_10_Pointer)=-2, \read(*WrapperStruct00_var_1_11_Pointer)=-7, \read(*WrapperStruct00_var_1_12_Pointer)=30, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_13_Pointer)=1, \read(*WrapperStruct00_var_1_15_Pointer)=-511, \read(*WrapperStruct00_var_1_16_Pointer)=-255, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_18_Pointer)=7, \read(*WrapperStruct00_var_1_19_Pointer)=7, \read(*WrapperStruct00_var_1_1_Pointer)=8, \read(*WrapperStruct00_var_1_20_Pointer)=20124, \read(*WrapperStruct00_var_1_20_Pointer)=20124, \read(*WrapperStruct00_var_1_21_Pointer)=20124, \read(*WrapperStruct00_var_1_22_Pointer)=30, \read(*WrapperStruct00_var_1_7_Pointer)=7, isInitial=1] [L135-L136] return ((((((*(WrapperStruct00_var_1_13_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_22_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_7_Pointer)) - ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_18_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(WrapperStruct00_var_1_18_Pointer)) == (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_11_Pointer)) + ((*(WrapperStruct00_var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(WrapperStruct00_var_1_22_Pointer))) >= (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_15_Pointer)) && (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_20_Pointer)) >= (*(WrapperStruct00_var_1_20_Pointer))) || (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_21_Pointer))))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_12_Pointer)))) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_15_Pointer={4:12}, WrapperStruct00_var_1_16_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:14}, WrapperStruct00_var_1_19_Pointer={4:16}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:18}, WrapperStruct00_var_1_21_Pointer={4:22}, WrapperStruct00_var_1_22_Pointer={4:26}, WrapperStruct00_var_1_7_Pointer={4:2}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:6}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 129.1s, OverallIterations: 30, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7239 SdHoareTripleChecker+Valid, 18.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7212 mSDsluCounter, 16356 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12471 mSDsCounter, 774 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13684 IncrementalHoareTripleChecker+Invalid, 14458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 774 mSolverCounterUnsat, 3885 mSDtfsCounter, 13684 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2251 GetRequests, 1847 SyntacticMatches, 6 SemanticMatches, 398 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=668occurred in iteration=29, InterpolantAutomatonStates: 257, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 1808 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 90.1s InterpolantComputationTime, 4857 NumberOfCodeBlocks, 4857 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4680 ConstructedInterpolants, 0 QuantifiedInterpolants, 59411 SizeOfPredicates, 78 NumberOfNonLiveVariables, 2574 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 34 InterpolantComputations, 25 PerfectInterpolantSequences, 18090/18496 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:50:03,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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 c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:50:05,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:50:05,869 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:50:05,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:50:05,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:50:05,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:50:05,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:50:05,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:50:05,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:50:05,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:50:05,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:50:05,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:50:05,940 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:50:05,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:50:05,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:50:05,943 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:50:05,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:50:05,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:50:05,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:50:05,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:50:05,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:50:05,947 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:50:05,947 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:50:05,948 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:50:05,948 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:50:05,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:50:05,949 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:50:05,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:50:05,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:50:05,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:50:05,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:50:05,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:50:05,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:50:05,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:50:05,955 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:50:05,955 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:50:05,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:50:05,955 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:50:05,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:50:05,957 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:50:05,957 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:50:05,957 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:50:05,957 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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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 -> c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5 [2023-11-06 22:50:06,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:50:06,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:50:06,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:50:06,478 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:50:06,478 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:50:06,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i [2023-11-06 22:50:09,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:50:10,100 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:50:10,101 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i [2023-11-06 22:50:10,120 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/data/965a87c8f/80ab325db46540b48f4ca4e57818a349/FLAG46df9929e [2023-11-06 22:50:10,132 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/data/965a87c8f/80ab325db46540b48f4ca4e57818a349 [2023-11-06 22:50:10,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:50:10,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:50:10,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:50:10,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:50:10,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:50:10,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76463085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10, skipping insertion in model container [2023-11-06 22:50:10,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,188 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:50:10,354 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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i[917,930] [2023-11-06 22:50:10,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:50:10,471 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:50:10,496 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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i[917,930] [2023-11-06 22:50:10,571 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:50:10,625 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:50:10,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10 WrapperNode [2023-11-06 22:50:10,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:50:10,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:50:10,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:50:10,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:50:10,636 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:50:10" (1/1) ... [2023-11-06 22:50:10,655 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:50:10" (1/1) ... [2023-11-06 22:50:10,693 INFO L138 Inliner]: procedures = 33, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 373 [2023-11-06 22:50:10,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:50:10,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:50:10,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:50:10,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:50:10,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:50:10,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:50:10,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:50:10,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:50:10,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10" (1/1) ... [2023-11-06 22:50:10,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:50:10,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:50:10,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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:50:10,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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:50:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:50:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:50:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:50:10,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:50:10,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:50:10,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:50:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:50:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:50:10,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:50:10,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:50:10,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:50:10,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:50:10,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:50:10,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:50:11,067 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:50:11,073 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:50:11,855 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:50:11,863 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:50:11,864 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:50:11,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:11 BoogieIcfgContainer [2023-11-06 22:50:11,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:50:11,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:50:11,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:50:11,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:50:11,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:50:10" (1/3) ... [2023-11-06 22:50:11,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d24013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:11, skipping insertion in model container [2023-11-06 22:50:11,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:10" (2/3) ... [2023-11-06 22:50:11,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d24013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:11, skipping insertion in model container [2023-11-06 22:50:11,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:11" (3/3) ... [2023-11-06 22:50:11,877 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-97.i [2023-11-06 22:50:11,898 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:50:11,899 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:50:11,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:50:11,978 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;@1a8c43a0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:50:11,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:50:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:50:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:50:12,002 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:12,003 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:12,004 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:12,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:12,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1614699708, now seen corresponding path program 1 times [2023-11-06 22:50:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:50:12,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758057252] [2023-11-06 22:50:12,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:12,030 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:50:12,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:50:12,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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:50:12,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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:50:12,460 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Exception during sending of exit command (exit): Broken pipe [2023-11-06 22:50:12,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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:50:12,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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:50:12,661 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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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:50:12,666 INFO L158 Benchmark]: Toolchain (without parser) took 2528.43ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 53.9MB in the beginning and 72.3MB in the end (delta: -18.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-06 22:50:12,666 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 77.6MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:50:12,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.78ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 53.7MB in the beginning and 77.3MB in the end (delta: -23.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2023-11-06 22:50:12,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.73ms. Allocated memory is still 98.6MB. Free memory was 77.3MB in the beginning and 74.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:50:12,668 INFO L158 Benchmark]: Boogie Preprocessor took 61.44ms. Allocated memory is still 98.6MB. Free memory was 74.1MB in the beginning and 71.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:50:12,669 INFO L158 Benchmark]: RCFGBuilder took 1109.77ms. Allocated memory is still 98.6MB. Free memory was 71.0MB in the beginning and 68.3MB in the end (delta: 2.7MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2023-11-06 22:50:12,670 INFO L158 Benchmark]: TraceAbstraction took 794.32ms. Allocated memory is still 98.6MB. Free memory was 67.9MB in the beginning and 72.3MB in the end (delta: -4.5MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2023-11-06 22:50:12,673 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.29ms. Allocated memory is still 77.6MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.78ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 53.7MB in the beginning and 77.3MB in the end (delta: -23.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.73ms. Allocated memory is still 98.6MB. Free memory was 77.3MB in the beginning and 74.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.44ms. Allocated memory is still 98.6MB. Free memory was 74.1MB in the beginning and 71.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1109.77ms. Allocated memory is still 98.6MB. Free memory was 71.0MB in the beginning and 68.3MB in the end (delta: 2.7MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 794.32ms. Allocated memory is still 98.6MB. Free memory was 67.9MB in the beginning and 72.3MB in the end (delta: -4.5MB). Peak memory consumption was 27.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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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:50:12,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_924734e6-0405-4ffe-8609-3ce2ae3b4b02/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_924734e6-0405-4ffe-8609-3ce2ae3b4b02/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.