./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05d1274571884b61e0bf3945fec02c622819cbfceb65bf4937493085e5ba6604 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:39:49,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:39:49,586 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 18:39:49,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:39:49,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:39:49,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:39:49,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:39:49,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:39:49,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:39:49,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:39:49,617 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:39:49,617 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:39:49,618 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:39:49,618 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:39:49,619 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:39:49,619 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:39:49,620 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:39:49,620 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:39:49,621 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:39:49,622 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:39:49,622 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:39:49,623 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:39:49,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 18:39:49,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 18:39:49,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:39:49,625 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:39:49,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:39:49,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:39:49,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:39:49,627 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 18:39:49,627 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 18:39:49,627 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 18:39:49,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:39:49,628 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:39:49,628 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 18:39:49,628 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:39:49,629 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:39:49,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:39:49,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:39:49,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:39:49,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:39:49,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:39:49,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:39:49,630 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:39:49,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:39:49,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:39:49,631 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:39:49,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:39:49,631 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/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_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 05d1274571884b61e0bf3945fec02c622819cbfceb65bf4937493085e5ba6604 [2023-12-02 18:39:49,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:39:49,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:39:49,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:39:49,852 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:39:49,853 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:39:49,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2023-12-02 18:39:52,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:39:52,757 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:39:52,758 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2023-12-02 18:39:52,765 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/data/6afbf2b86/37d36ae44c1c4940a87a20b38d9effd9/FLAG22aa9d2fb [2023-12-02 18:39:52,779 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/data/6afbf2b86/37d36ae44c1c4940a87a20b38d9effd9 [2023-12-02 18:39:52,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:39:52,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:39:52,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:39:52,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:39:52,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:39:52,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:52,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458bed07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52, skipping insertion in model container [2023-12-02 18:39:52,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:52,811 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:39:52,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:39:52,953 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:39:52,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:39:52,977 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:39:52,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52 WrapperNode [2023-12-02 18:39:52,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:39:52,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:39:52,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:39:52,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:39:52,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:52,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:53,005 INFO L138 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2023-12-02 18:39:53,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:39:53,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:39:53,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:39:53,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:39:53,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:53,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:53,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:53,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:53,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:53,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:53,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:53,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:53,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:39:53,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:39:53,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:39:53,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:39:53,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (1/1) ... [2023-12-02 18:39:53,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:39:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:39:53,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:39:53,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:39:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 18:39:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:39:53,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:39:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 18:39:53,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:39:53,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:39:53,163 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:39:53,165 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:39:53,320 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:39:53,373 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:39:53,373 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-02 18:39:53,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:39:53 BoogieIcfgContainer [2023-12-02 18:39:53,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:39:53,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:39:53,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:39:53,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:39:53,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:39:52" (1/3) ... [2023-12-02 18:39:53,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ff48ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:39:53, skipping insertion in model container [2023-12-02 18:39:53,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:39:52" (2/3) ... [2023-12-02 18:39:53,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ff48ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:39:53, skipping insertion in model container [2023-12-02 18:39:53,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:39:53" (3/3) ... [2023-12-02 18:39:53,385 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-write.c [2023-12-02 18:39:53,399 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:39:53,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-02 18:39:53,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:39:53,441 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@144ab3c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:39:53,441 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-12-02 18:39:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 10 states have (on average 2.2) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 18:39:53,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:39:53,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 18:39:53,451 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:39:53,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:39:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash 3182528, now seen corresponding path program 1 times [2023-12-02 18:39:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:39:53,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492929253] [2023-12-02 18:39:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:53,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:39:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:53,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:53,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:39:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492929253] [2023-12-02 18:39:53,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492929253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:39:53,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:39:53,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:39:53,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552292131] [2023-12-02 18:39:53,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:39:53,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:39:53,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:39:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:39:53,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:39:53,713 INFO L87 Difference]: Start difference. First operand has 19 states, 10 states have (on average 2.2) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:39:53,779 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2023-12-02 18:39:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:39:53,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 18:39:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:39:53,789 INFO L225 Difference]: With dead ends: 36 [2023-12-02 18:39:53,789 INFO L226 Difference]: Without dead ends: 35 [2023-12-02 18:39:53,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:39:53,795 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:39:53,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 16 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:39:53,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-02 18:39:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2023-12-02 18:39:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-12-02 18:39:53,829 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 4 [2023-12-02 18:39:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:39:53,829 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-12-02 18:39:53,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-12-02 18:39:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 18:39:53,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:39:53,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 18:39:53,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 18:39:53,831 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:39:53,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:39:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash 3108451, now seen corresponding path program 1 times [2023-12-02 18:39:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:39:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649822496] [2023-12-02 18:39:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:39:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:53,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:39:53,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649822496] [2023-12-02 18:39:53,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649822496] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:39:53,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:39:53,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:39:53,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395559664] [2023-12-02 18:39:53,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:39:53,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:39:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:39:53,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:39:53,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:39:53,910 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:39:53,943 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-12-02 18:39:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:39:53,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 18:39:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:39:53,944 INFO L225 Difference]: With dead ends: 25 [2023-12-02 18:39:53,944 INFO L226 Difference]: Without dead ends: 25 [2023-12-02 18:39:53,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:39:53,947 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:39:53,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:39:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-02 18:39:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-12-02 18:39:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-02 18:39:53,952 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 4 [2023-12-02 18:39:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:39:53,953 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-02 18:39:53,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-02 18:39:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 18:39:53,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:39:53,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 18:39:53,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 18:39:53,954 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:39:53,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:39:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash 3110481, now seen corresponding path program 1 times [2023-12-02 18:39:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:39:53,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100442139] [2023-12-02 18:39:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:53,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:39:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:54,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:39:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100442139] [2023-12-02 18:39:54,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100442139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:39:54,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:39:54,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:39:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526373336] [2023-12-02 18:39:54,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:39:54,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:39:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:39:54,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:39:54,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:39:54,060 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:39:54,135 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2023-12-02 18:39:54,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:39:54,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 18:39:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:39:54,137 INFO L225 Difference]: With dead ends: 42 [2023-12-02 18:39:54,137 INFO L226 Difference]: Without dead ends: 42 [2023-12-02 18:39:54,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-02 18:39:54,139 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:39:54,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 17 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:39:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-02 18:39:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 23. [2023-12-02 18:39:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-12-02 18:39:54,145 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 4 [2023-12-02 18:39:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:39:54,146 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-12-02 18:39:54,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-12-02 18:39:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 18:39:54,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:39:54,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 18:39:54,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 18:39:54,147 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:39:54,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:39:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash 96362034, now seen corresponding path program 1 times [2023-12-02 18:39:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:39:54,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009003806] [2023-12-02 18:39:54,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:54,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:39:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:54,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:39:54,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009003806] [2023-12-02 18:39:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009003806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:39:54,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:39:54,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:39:54,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29163678] [2023-12-02 18:39:54,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:39:54,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:39:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:39:54,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:39:54,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:39:54,221 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:39:54,259 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2023-12-02 18:39:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:39:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 18:39:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:39:54,260 INFO L225 Difference]: With dead ends: 22 [2023-12-02 18:39:54,260 INFO L226 Difference]: Without dead ends: 22 [2023-12-02 18:39:54,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-12-02 18:39:54,262 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:39:54,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:39:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-02 18:39:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-02 18:39:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-02 18:39:54,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 5 [2023-12-02 18:39:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:39:54,267 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-02 18:39:54,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-02 18:39:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 18:39:54,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:39:54,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 18:39:54,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 18:39:54,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:39:54,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:39:54,269 INFO L85 PathProgramCache]: Analyzing trace with hash 96362035, now seen corresponding path program 1 times [2023-12-02 18:39:54,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:39:54,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980654893] [2023-12-02 18:39:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:54,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:39:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:54,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:39:54,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980654893] [2023-12-02 18:39:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980654893] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:39:54,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:39:54,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:39:54,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224688073] [2023-12-02 18:39:54,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:39:54,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:39:54,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:39:54,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:39:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:39:54,387 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:39:54,478 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-12-02 18:39:54,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:39:54,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 18:39:54,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:39:54,480 INFO L225 Difference]: With dead ends: 23 [2023-12-02 18:39:54,480 INFO L226 Difference]: Without dead ends: 23 [2023-12-02 18:39:54,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-12-02 18:39:54,481 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:39:54,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:39:54,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-02 18:39:54,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-02 18:39:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-12-02 18:39:54,485 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 5 [2023-12-02 18:39:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:39:54,485 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-12-02 18:39:54,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-12-02 18:39:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 18:39:54,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:39:54,486 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-02 18:39:54,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 18:39:54,487 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:39:54,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:39:54,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1885310484, now seen corresponding path program 1 times [2023-12-02 18:39:54,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:39:54,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132292715] [2023-12-02 18:39:54,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:54,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:39:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:54,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:39:54,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132292715] [2023-12-02 18:39:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132292715] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:39:54,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119811103] [2023-12-02 18:39:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:54,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:39:54,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:39:54,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:39:54,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 18:39:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:54,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:39:54,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:39:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:54,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:39:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:54,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119811103] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:39:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [982808340] [2023-12-02 18:39:54,698 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2023-12-02 18:39:54,698 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:39:54,702 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:39:54,707 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:39:54,708 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:39:55,360 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:39:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [982808340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:39:55,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:39:55,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3, 3] total 9 [2023-12-02 18:39:55,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077957013] [2023-12-02 18:39:55,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:39:55,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:39:55,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:39:55,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:39:55,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:39:55,621 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:39:55,923 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-12-02 18:39:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:39:55,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 18:39:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:39:55,924 INFO L225 Difference]: With dead ends: 30 [2023-12-02 18:39:55,924 INFO L226 Difference]: Without dead ends: 30 [2023-12-02 18:39:55,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-02 18:39:55,925 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:39:55,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 13 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:39:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-02 18:39:55,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-12-02 18:39:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-02 18:39:55,930 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2023-12-02 18:39:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:39:55,930 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-02 18:39:55,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-02 18:39:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 18:39:55,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:39:55,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2023-12-02 18:39:55,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 18:39:56,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:39:56,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:39:56,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:39:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1684917194, now seen corresponding path program 1 times [2023-12-02 18:39:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:39:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084306506] [2023-12-02 18:39:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:39:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:56,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:39:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084306506] [2023-12-02 18:39:56,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084306506] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:39:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776583353] [2023-12-02 18:39:56,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:56,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:39:56,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:39:56,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:39:56,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 18:39:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:56,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 18:39:56,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:39:56,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2023-12-02 18:39:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:56,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:39:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:56,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776583353] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:39:56,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [32993800] [2023-12-02 18:39:56,508 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2023-12-02 18:39:56,508 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:39:56,509 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:39:56,509 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:39:56,509 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:39:56,839 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:39:57,260 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '466#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (<= |ULTIMATE.start_foo_~i~0#1| 1) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_#in~size#1| 1) (<= (select |#length| |ULTIMATE.start_foo_~b#1.base|) |ULTIMATE.start_foo_~i~0#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:39:57,260 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:39:57,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:39:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2023-12-02 18:39:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726415021] [2023-12-02 18:39:57,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:39:57,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 18:39:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:39:57,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 18:39:57,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-02 18:39:57,262 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:39:57,415 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2023-12-02 18:39:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:39:57,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 18:39:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:39:57,417 INFO L225 Difference]: With dead ends: 49 [2023-12-02 18:39:57,417 INFO L226 Difference]: Without dead ends: 49 [2023-12-02 18:39:57,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2023-12-02 18:39:57,419 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 69 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:39:57,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 18 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:39:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-02 18:39:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2023-12-02 18:39:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.525) internal successors, (61), 46 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2023-12-02 18:39:57,425 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 8 [2023-12-02 18:39:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:39:57,425 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2023-12-02 18:39:57,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2023-12-02 18:39:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 18:39:57,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:39:57,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:39:57,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 18:39:57,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 18:39:57,629 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:39:57,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:39:57,629 INFO L85 PathProgramCache]: Analyzing trace with hash 64570769, now seen corresponding path program 1 times [2023-12-02 18:39:57,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:39:57,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696915292] [2023-12-02 18:39:57,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:39:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:39:57,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:39:57,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696915292] [2023-12-02 18:39:57,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696915292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:39:57,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:39:57,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:39:57,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182292749] [2023-12-02 18:39:57,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:39:57,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:39:57,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:39:57,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:39:57,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:39:57,652 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:39:57,672 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2023-12-02 18:39:57,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:39:57,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 18:39:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:39:57,673 INFO L225 Difference]: With dead ends: 45 [2023-12-02 18:39:57,673 INFO L226 Difference]: Without dead ends: 45 [2023-12-02 18:39:57,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:39:57,674 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:39:57,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:39:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-02 18:39:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-02 18:39:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.475) internal successors, (59), 44 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2023-12-02 18:39:57,680 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 10 [2023-12-02 18:39:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:39:57,680 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2023-12-02 18:39:57,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2023-12-02 18:39:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 18:39:57,681 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:39:57,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:39:57,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 18:39:57,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:39:57,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:39:57,682 INFO L85 PathProgramCache]: Analyzing trace with hash 64570770, now seen corresponding path program 1 times [2023-12-02 18:39:57,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:39:57,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870283900] [2023-12-02 18:39:57,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:57,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:39:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 18:39:57,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:39:57,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870283900] [2023-12-02 18:39:57,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870283900] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:39:57,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324076314] [2023-12-02 18:39:57,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:57,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:39:57,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:39:57,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:39:57,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 18:39:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:57,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:39:57,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:39:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:57,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:39:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324076314] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:39:57,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [175021040] [2023-12-02 18:39:57,899 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-12-02 18:39:57,899 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:39:57,899 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:39:57,899 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:39:57,899 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:39:58,321 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:39:58,614 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '731#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_~i~1#1| 0) (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) 3) (exists ((|v_ULTIMATE.start_main_~i~1#1_47| Int)) (and (<= 1 |#StackHeapBarrier|) (<= 32 (mod |v_ULTIMATE.start_main_~i~1#1_47| 4294967296)) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (<= 0 |v_ULTIMATE.start_main_~i~1#1_47|))))' at error location [2023-12-02 18:39:58,614 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:39:58,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:39:58,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2023-12-02 18:39:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559701384] [2023-12-02 18:39:58,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:39:58,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 18:39:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:39:58,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 18:39:58,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-12-02 18:39:58,616 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:39:58,808 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2023-12-02 18:39:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 18:39:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 18:39:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:39:58,810 INFO L225 Difference]: With dead ends: 48 [2023-12-02 18:39:58,810 INFO L226 Difference]: Without dead ends: 48 [2023-12-02 18:39:58,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2023-12-02 18:39:58,811 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 76 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:39:58,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 7 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:39:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-02 18:39:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-12-02 18:39:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 45 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2023-12-02 18:39:58,816 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 10 [2023-12-02 18:39:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:39:58,816 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2023-12-02 18:39:58,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:39:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2023-12-02 18:39:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 18:39:58,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:39:58,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:39:58,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 18:39:59,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-02 18:39:59,021 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:39:59,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:39:59,021 INFO L85 PathProgramCache]: Analyzing trace with hash 654021878, now seen corresponding path program 1 times [2023-12-02 18:39:59,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:39:59,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659343581] [2023-12-02 18:39:59,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:39:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:39:59,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:39:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659343581] [2023-12-02 18:39:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659343581] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:39:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924422266] [2023-12-02 18:39:59,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:39:59,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:39:59,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:39:59,133 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:39:59,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 18:39:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:39:59,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:39:59,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:39:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:59,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:39:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:39:59,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924422266] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:39:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2146826651] [2023-12-02 18:39:59,323 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-12-02 18:39:59,323 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:39:59,323 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:39:59,323 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:39:59,324 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:39:59,911 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:00,762 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '942#(and (= |ULTIMATE.start_main_~i~1#1| 0) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (= |ULTIMATE.start_main_#res#1| 1) (exists ((|v_#valid_44| (Array Int Int)) (|v_ULTIMATE.start_main_~#b~0#1.offset_25| Int) (|v_ULTIMATE.start_main_~#mask~0#1.base_21| Int) (|v_ULTIMATE.start_main_~#mask~0#1.offset_18| Int) (|v_ULTIMATE.start_main_~#b~0#1.base_30| Int) (|v_ULTIMATE.start_main_~i~1#1_54| Int)) (and (<= 1 |#StackHeapBarrier|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#b~0#1.base_30|) 1) (<= 32 (mod |v_ULTIMATE.start_main_~i~1#1_54| 4294967296)) (= |#valid| (store (store |v_#valid_44| |v_ULTIMATE.start_main_~#b~0#1.base_30| 0) |v_ULTIMATE.start_main_~#mask~0#1.base_21| 0)) (<= 4 (select |#length| |v_ULTIMATE.start_main_~#b~0#1.base_30|)) (= |v_ULTIMATE.start_main_~#b~0#1.offset_25| 0) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~#b~0#1.base_30|) 0) 1)) (<= 2 |v_ULTIMATE.start_main_~#b~0#1.base_30|) (= |v_ULTIMATE.start_main_~#mask~0#1.offset_18| 0) (<= 0 |v_ULTIMATE.start_main_~i~1#1_54|) (<= 2 |v_ULTIMATE.start_main_~#mask~0#1.base_21|))))' at error location [2023-12-02 18:40:00,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:00,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:00,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2023-12-02 18:40:00,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068740409] [2023-12-02 18:40:00,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:00,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 18:40:00,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:00,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 18:40:00,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=312, Unknown=1, NotChecked=0, Total=420 [2023-12-02 18:40:00,765 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:00,952 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2023-12-02 18:40:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 18:40:00,953 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 18:40:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:00,954 INFO L225 Difference]: With dead ends: 106 [2023-12-02 18:40:00,954 INFO L226 Difference]: Without dead ends: 106 [2023-12-02 18:40:00,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2023-12-02 18:40:00,955 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 85 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:00,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 25 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-02 18:40:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2023-12-02 18:40:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 88 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2023-12-02 18:40:00,963 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 15 [2023-12-02 18:40:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:00,964 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2023-12-02 18:40:00,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2023-12-02 18:40:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 18:40:00,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:00,965 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1] [2023-12-02 18:40:00,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 18:40:01,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:01,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:01,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1303154829, now seen corresponding path program 2 times [2023-12-02 18:40:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:01,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109211320] [2023-12-02 18:40:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:40:01,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:01,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109211320] [2023-12-02 18:40:01,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109211320] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985023900] [2023-12-02 18:40:01,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:40:01,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:01,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:01,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 18:40:01,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:40:01,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:01,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 18:40:01,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:01,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 18:40:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 18:40:01,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 18:40:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985023900] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:01,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [734997945] [2023-12-02 18:40:01,627 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2023-12-02 18:40:01,628 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:01,628 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:01,628 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:01,628 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:01,861 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:02,359 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1266#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (= |ULTIMATE.start_main_~i~1#1| 0) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (<= |ULTIMATE.start_foo_~i~0#1| 1) (= |ULTIMATE.start_foo_~b#1.offset| 0) (= |ULTIMATE.start_foo_#in~size#1| 1) (<= (select |#length| |ULTIMATE.start_foo_~b#1.base|) |ULTIMATE.start_foo_~i~0#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (= |ULTIMATE.start_foo_~size#1| 1) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:40:02,360 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:02,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:02,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 15 [2023-12-02 18:40:02,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087947596] [2023-12-02 18:40:02,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:02,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 18:40:02,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:02,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 18:40:02,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2023-12-02 18:40:02,362 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:02,621 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2023-12-02 18:40:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 18:40:02,622 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 18:40:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:02,622 INFO L225 Difference]: With dead ends: 85 [2023-12-02 18:40:02,622 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 18:40:02,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2023-12-02 18:40:02,624 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:02,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 22 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 18:40:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2023-12-02 18:40:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 73 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2023-12-02 18:40:02,630 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 17 [2023-12-02 18:40:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:02,630 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2023-12-02 18:40:02,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2023-12-02 18:40:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 18:40:02,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:02,632 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1] [2023-12-02 18:40:02,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 18:40:02,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:02,837 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:02,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1686549522, now seen corresponding path program 1 times [2023-12-02 18:40:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972368581] [2023-12-02 18:40:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 18:40:02,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972368581] [2023-12-02 18:40:02,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972368581] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:02,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077072967] [2023-12-02 18:40:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:02,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:02,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:02,917 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:02,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 18:40:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:02,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:40:02,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 18:40:03,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 18:40:03,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077072967] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:03,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [350032029] [2023-12-02 18:40:03,036 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:03,036 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:03,036 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:03,037 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:03,037 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:03,669 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:03,729 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1560#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:40:03,729 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:03,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:03,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-12-02 18:40:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301699300] [2023-12-02 18:40:03,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:03,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 18:40:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 18:40:03,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-02 18:40:03,731 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:03,836 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2023-12-02 18:40:03,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:40:03,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 18:40:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:03,837 INFO L225 Difference]: With dead ends: 97 [2023-12-02 18:40:03,837 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 18:40:03,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-12-02 18:40:03,838 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:03,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 22 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 18:40:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2023-12-02 18:40:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 95 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2023-12-02 18:40:03,844 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 19 [2023-12-02 18:40:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:03,845 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2023-12-02 18:40:03,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2023-12-02 18:40:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 18:40:03,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:03,846 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1] [2023-12-02 18:40:03,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 18:40:04,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 18:40:04,046 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:04,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1686547491, now seen corresponding path program 1 times [2023-12-02 18:40:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:04,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327820698] [2023-12-02 18:40:04,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:04,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:40:04,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:04,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327820698] [2023-12-02 18:40:04,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327820698] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:04,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133084644] [2023-12-02 18:40:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:04,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:04,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:04,183 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:04,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 18:40:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:04,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:40:04,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:40:04,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:40:04,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133084644] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:04,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1867477173] [2023-12-02 18:40:04,386 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:04,386 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:04,386 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:04,386 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:04,386 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:04,980 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:05,049 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1886#(and (<= 0 |ULTIMATE.start_foo_#res#1|) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (or (< (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) 0) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4))) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647))' at error location [2023-12-02 18:40:05,049 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:05,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:05,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-12-02 18:40:05,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183954540] [2023-12-02 18:40:05,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:05,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 18:40:05,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 18:40:05,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-12-02 18:40:05,051 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:05,170 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2023-12-02 18:40:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 18:40:05,171 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 18:40:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:05,172 INFO L225 Difference]: With dead ends: 98 [2023-12-02 18:40:05,172 INFO L226 Difference]: Without dead ends: 98 [2023-12-02 18:40:05,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2023-12-02 18:40:05,173 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:05,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 9 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-02 18:40:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2023-12-02 18:40:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 95 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2023-12-02 18:40:05,176 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 19 [2023-12-02 18:40:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:05,177 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2023-12-02 18:40:05,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2023-12-02 18:40:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 18:40:05,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:05,178 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1] [2023-12-02 18:40:05,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 18:40:05,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 18:40:05,378 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:05,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:05,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1469272976, now seen corresponding path program 2 times [2023-12-02 18:40:05,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:05,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102463378] [2023-12-02 18:40:05,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 18:40:05,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:05,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102463378] [2023-12-02 18:40:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102463378] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:05,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005876825] [2023-12-02 18:40:05,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:40:05,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:05,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:05,604 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:05,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 18:40:05,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:40:05,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:05,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 18:40:05,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:05,686 INFO L378 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 10 treesize of output 8 [2023-12-02 18:40:05,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 18:40:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 18:40:05,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 18:40:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005876825] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1353241215] [2023-12-02 18:40:05,938 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:05,938 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:05,938 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:05,938 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:05,938 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:06,519 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:06,598 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2232#(and (<= 0 |ULTIMATE.start_foo_#res#1|) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (or (< (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) 0) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4))) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647))' at error location [2023-12-02 18:40:06,598 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:06,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 9 [2023-12-02 18:40:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564454094] [2023-12-02 18:40:06,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:06,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 18:40:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 18:40:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-02 18:40:06,599 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:06,686 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2023-12-02 18:40:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:40:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-02 18:40:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:06,688 INFO L225 Difference]: With dead ends: 122 [2023-12-02 18:40:06,688 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 18:40:06,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-12-02 18:40:06,689 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:06,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 29 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 18:40:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2023-12-02 18:40:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 116 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2023-12-02 18:40:06,693 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 22 [2023-12-02 18:40:06,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:06,693 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2023-12-02 18:40:06,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2023-12-02 18:40:06,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 18:40:06,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:06,694 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 1, 1, 1, 1] [2023-12-02 18:40:06,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 18:40:06,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 18:40:06,894 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:06,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:06,895 INFO L85 PathProgramCache]: Analyzing trace with hash -476177874, now seen corresponding path program 2 times [2023-12-02 18:40:06,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:06,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718404579] [2023-12-02 18:40:06,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:06,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 43 proven. 62 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:40:07,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:07,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718404579] [2023-12-02 18:40:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718404579] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:07,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344471386] [2023-12-02 18:40:07,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:40:07,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:07,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:07,114 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:07,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 18:40:07,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:40:07,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:07,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 18:40:07,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-02 18:40:07,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-02 18:40:07,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344471386] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:07,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1768536780] [2023-12-02 18:40:07,609 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:07,609 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:07,609 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:07,609 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:07,609 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:08,167 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:08,453 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2682#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:40:08,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:08,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:08,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 21 [2023-12-02 18:40:08,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917313398] [2023-12-02 18:40:08,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:08,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 18:40:08,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:08,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 18:40:08,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2023-12-02 18:40:08,455 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:08,872 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2023-12-02 18:40:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 18:40:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 18:40:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:08,873 INFO L225 Difference]: With dead ends: 114 [2023-12-02 18:40:08,873 INFO L226 Difference]: Without dead ends: 114 [2023-12-02 18:40:08,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=1287, Unknown=0, NotChecked=0, Total=1560 [2023-12-02 18:40:08,875 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 60 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:08,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 26 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:40:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-02 18:40:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2023-12-02 18:40:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.25) internal successors, (115), 96 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2023-12-02 18:40:08,880 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 31 [2023-12-02 18:40:08,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:08,880 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2023-12-02 18:40:08,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2023-12-02 18:40:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 18:40:08,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:08,882 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 3, 2, 2, 1, 1] [2023-12-02 18:40:08,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 18:40:09,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 18:40:09,085 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:09,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:09,085 INFO L85 PathProgramCache]: Analyzing trace with hash 901731750, now seen corresponding path program 1 times [2023-12-02 18:40:09,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:09,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315780409] [2023-12-02 18:40:09,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:09,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 88 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 18:40:09,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:09,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315780409] [2023-12-02 18:40:09,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315780409] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586048363] [2023-12-02 18:40:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:09,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:09,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:09,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:09,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 18:40:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:09,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 18:40:09,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 40 proven. 103 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 18:40:09,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 40 proven. 103 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 18:40:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586048363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:09,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [549926006] [2023-12-02 18:40:09,705 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:09,705 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:09,705 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:09,706 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:09,706 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:10,461 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:10,549 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3165#(and (or (< (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset|) 0) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1))) (<= (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 31) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:40:10,549 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:10,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:10,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2023-12-02 18:40:10,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466107457] [2023-12-02 18:40:10,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:10,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 18:40:10,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:10,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 18:40:10,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2023-12-02 18:40:10,550 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:10,830 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2023-12-02 18:40:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 18:40:10,831 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-02 18:40:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:10,832 INFO L225 Difference]: With dead ends: 138 [2023-12-02 18:40:10,832 INFO L226 Difference]: Without dead ends: 138 [2023-12-02 18:40:10,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 18:40:10,833 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:10,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 15 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-02 18:40:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2023-12-02 18:40:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.2066115702479339) internal successors, (146), 125 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2023-12-02 18:40:10,838 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 38 [2023-12-02 18:40:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:10,838 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2023-12-02 18:40:10,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2023-12-02 18:40:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 18:40:10,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:10,840 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-12-02 18:40:10,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 18:40:11,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 18:40:11,046 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:11,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1315085316, now seen corresponding path program 2 times [2023-12-02 18:40:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:11,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608815930] [2023-12-02 18:40:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 113 proven. 87 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 18:40:11,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:11,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608815930] [2023-12-02 18:40:11,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608815930] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:11,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017788455] [2023-12-02 18:40:11,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:40:11,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:11,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:11,393 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:11,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 18:40:11,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 18:40:11,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:11,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 18:40:11,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-02 18:40:12,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:40:12,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017788455] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:40:12,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:40:12,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 12 [2023-12-02 18:40:12,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719460659] [2023-12-02 18:40:12,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:40:12,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:40:12,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:12,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:40:12,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-12-02 18:40:12,319 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:12,379 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2023-12-02 18:40:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:40:12,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-02 18:40:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:12,381 INFO L225 Difference]: With dead ends: 125 [2023-12-02 18:40:12,381 INFO L226 Difference]: Without dead ends: 124 [2023-12-02 18:40:12,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-12-02 18:40:12,381 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:12,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-12-02 18:40:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2023-12-02 18:40:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 115 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2023-12-02 18:40:12,386 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 51 [2023-12-02 18:40:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:12,386 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2023-12-02 18:40:12,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2023-12-02 18:40:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 18:40:12,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:12,388 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2023-12-02 18:40:12,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 18:40:12,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 18:40:12,589 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:12,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2112935793, now seen corresponding path program 1 times [2023-12-02 18:40:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:12,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151242025] [2023-12-02 18:40:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:12,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 113 proven. 87 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 18:40:12,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:12,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151242025] [2023-12-02 18:40:12,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151242025] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:12,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094864971] [2023-12-02 18:40:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:12,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:12,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:12,969 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:12,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 18:40:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:13,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 18:40:13,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 130 proven. 70 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 18:40:13,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 130 proven. 70 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 18:40:13,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094864971] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:13,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [905210420] [2023-12-02 18:40:13,301 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 18:40:13,301 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:13,302 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:13,302 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:13,302 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:13,937 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:14,060 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4188#(and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 31) (<= 0 |ULTIMATE.start_main_~i~1#1|) (or (< (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) 0) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4))))' at error location [2023-12-02 18:40:14,060 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:14,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:14,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2023-12-02 18:40:14,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373231893] [2023-12-02 18:40:14,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:14,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 18:40:14,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:14,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 18:40:14,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2023-12-02 18:40:14,062 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:14,340 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2023-12-02 18:40:14,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 18:40:14,341 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-12-02 18:40:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:14,341 INFO L225 Difference]: With dead ends: 90 [2023-12-02 18:40:14,342 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 18:40:14,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 18:40:14,343 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:14,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 18:40:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2023-12-02 18:40:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-12-02 18:40:14,346 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 52 [2023-12-02 18:40:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:14,346 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-12-02 18:40:14,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-12-02 18:40:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 18:40:14,347 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:14,347 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 3, 3, 1, 1] [2023-12-02 18:40:14,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-02 18:40:14,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 18:40:14,548 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:14,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:14,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1079963573, now seen corresponding path program 2 times [2023-12-02 18:40:14,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:14,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98489612] [2023-12-02 18:40:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:14,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2023-12-02 18:40:14,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:14,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98489612] [2023-12-02 18:40:14,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98489612] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:14,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633182184] [2023-12-02 18:40:14,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:40:14,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:14,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:14,867 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:14,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 18:40:14,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:40:14,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:14,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 18:40:14,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:14,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-02 18:40:14,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:40:14,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-12-02 18:40:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 12 proven. 150 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2023-12-02 18:40:15,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2023-12-02 18:40:15,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633182184] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:15,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [406433119] [2023-12-02 18:40:15,534 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:15,535 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:15,535 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:15,535 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:15,535 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:16,077 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:16,182 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4718#(and (or (< (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset|) 0) (< (select |#length| |ULTIMATE.start_foo_~b#1.base|) (+ |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~b#1.offset| 1))) (<= (mod |ULTIMATE.start_foo_~i~0#1| 4294967296) 31) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:40:16,182 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:16,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:16,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2023-12-02 18:40:16,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609039374] [2023-12-02 18:40:16,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:16,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 18:40:16,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:16,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 18:40:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-12-02 18:40:16,183 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:16,382 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-12-02 18:40:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 18:40:16,383 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-02 18:40:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:16,383 INFO L225 Difference]: With dead ends: 89 [2023-12-02 18:40:16,384 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 18:40:16,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2023-12-02 18:40:16,385 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:16,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 18:40:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2023-12-02 18:40:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-12-02 18:40:16,388 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 53 [2023-12-02 18:40:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:16,388 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-12-02 18:40:16,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:16,388 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-12-02 18:40:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-02 18:40:16,389 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:16,389 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2023-12-02 18:40:16,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-02 18:40:16,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:16,597 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:16,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash 511100723, now seen corresponding path program 2 times [2023-12-02 18:40:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:16,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389643512] [2023-12-02 18:40:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 78 proven. 191 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-02 18:40:17,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:17,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389643512] [2023-12-02 18:40:17,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389643512] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:17,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066590400] [2023-12-02 18:40:17,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:40:17,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:17,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:17,026 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:17,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 18:40:17,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:40:17,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:17,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 18:40:17,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:17,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:40:17,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2023-12-02 18:40:17,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 18:40:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2023-12-02 18:40:17,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2023-12-02 18:40:17,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066590400] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:17,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [546275065] [2023-12-02 18:40:17,503 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 18:40:17,503 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:17,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:17,503 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:17,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:18,166 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:18,329 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5270#(and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 31) (<= 0 |ULTIMATE.start_main_~i~1#1|) (or (< (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) 0) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4))))' at error location [2023-12-02 18:40:18,329 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:18,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:18,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 3, 3] total 19 [2023-12-02 18:40:18,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733496247] [2023-12-02 18:40:18,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:18,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 18:40:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:18,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 18:40:18,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2023-12-02 18:40:18,331 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:19,004 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2023-12-02 18:40:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 18:40:19,005 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-12-02 18:40:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:19,005 INFO L225 Difference]: With dead ends: 94 [2023-12-02 18:40:19,005 INFO L226 Difference]: Without dead ends: 94 [2023-12-02 18:40:19,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=546, Invalid=2424, Unknown=0, NotChecked=0, Total=2970 [2023-12-02 18:40:19,007 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:19,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:40:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-02 18:40:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-02 18:40:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 91 states have (on average 1.0769230769230769) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2023-12-02 18:40:19,010 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 58 [2023-12-02 18:40:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:19,010 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2023-12-02 18:40:19,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 19 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2023-12-02 18:40:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 18:40:19,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:19,011 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2023-12-02 18:40:19,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 18:40:19,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:19,212 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:19,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash 342305104, now seen corresponding path program 3 times [2023-12-02 18:40:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:19,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375544268] [2023-12-02 18:40:19,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-12-02 18:40:19,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:19,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375544268] [2023-12-02 18:40:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375544268] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:19,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893810197] [2023-12-02 18:40:19,483 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:40:19,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:19,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:19,484 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:19,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 18:40:19,654 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:40:19,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:19,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 18:40:19,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:19,815 INFO L378 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 19 treesize of output 1 [2023-12-02 18:40:19,906 INFO L378 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 19 treesize of output 7 [2023-12-02 18:40:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 43 proven. 295 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 18:40:19,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:20,030 INFO L378 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 16 treesize of output 14 [2023-12-02 18:40:20,032 INFO L378 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 20 treesize of output 16 [2023-12-02 18:40:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 43 proven. 295 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 18:40:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893810197] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [856407602] [2023-12-02 18:40:20,115 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 18:40:20,115 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:20,115 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:20,116 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:20,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:20,663 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:20,842 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5965#(and (<= (mod |ULTIMATE.start_main_~i~1#1| 4294967296) 31) (<= 0 |ULTIMATE.start_main_~i~1#1|) (or (< (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) 0) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4))))' at error location [2023-12-02 18:40:20,842 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:20,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:20,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18, 18] total 30 [2023-12-02 18:40:20,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110292839] [2023-12-02 18:40:20,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:20,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 18:40:20,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:20,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 18:40:20,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1305, Unknown=0, NotChecked=0, Total=1482 [2023-12-02 18:40:20,844 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 31 states, 31 states have (on average 3.0) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:21,507 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2023-12-02 18:40:21,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 18:40:21,507 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.0) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-12-02 18:40:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:21,508 INFO L225 Difference]: With dead ends: 159 [2023-12-02 18:40:21,508 INFO L226 Difference]: Without dead ends: 147 [2023-12-02 18:40:21,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=405, Invalid=2901, Unknown=0, NotChecked=0, Total=3306 [2023-12-02 18:40:21,510 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 82 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:21,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 130 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:40:21,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-02 18:40:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 120. [2023-12-02 18:40:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 119 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2023-12-02 18:40:21,513 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 70 [2023-12-02 18:40:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:21,513 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2023-12-02 18:40:21,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.0) internal successors, (93), 30 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2023-12-02 18:40:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 18:40:21,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:21,514 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 5, 4, 4, 1, 1] [2023-12-02 18:40:21,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 18:40:21,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:21,715 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:21,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:21,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1266434589, now seen corresponding path program 3 times [2023-12-02 18:40:21,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:21,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640519001] [2023-12-02 18:40:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:21,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 416 proven. 153 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2023-12-02 18:40:22,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640519001] [2023-12-02 18:40:22,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640519001] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310240700] [2023-12-02 18:40:22,156 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:40:22,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:22,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:22,157 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:22,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 18:40:22,307 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:40:22,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:22,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 18:40:22,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 71 proven. 571 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-02 18:40:22,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 71 proven. 571 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-02 18:40:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310240700] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [965498726] [2023-12-02 18:40:22,709 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:22,709 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:22,709 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:22,710 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:22,710 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:23,168 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:23,617 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6768#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:40:23,617 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:23,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 28 [2023-12-02 18:40:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090878410] [2023-12-02 18:40:23,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:23,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 18:40:23,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:23,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 18:40:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2023-12-02 18:40:23,619 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:24,110 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2023-12-02 18:40:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-02 18:40:24,110 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-12-02 18:40:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:24,111 INFO L225 Difference]: With dead ends: 147 [2023-12-02 18:40:24,111 INFO L226 Difference]: Without dead ends: 147 [2023-12-02 18:40:24,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 200 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=627, Invalid=2795, Unknown=0, NotChecked=0, Total=3422 [2023-12-02 18:40:24,113 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:24,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:40:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-02 18:40:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2023-12-02 18:40:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 139 states have (on average 1.0719424460431655) internal successors, (149), 141 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2023-12-02 18:40:24,117 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 76 [2023-12-02 18:40:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:24,117 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2023-12-02 18:40:24,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2023-12-02 18:40:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 18:40:24,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:24,118 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 6, 6, 5, 1, 1] [2023-12-02 18:40:24,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 18:40:24,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:24,319 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:24,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1042849049, now seen corresponding path program 3 times [2023-12-02 18:40:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170272114] [2023-12-02 18:40:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 696 proven. 138 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2023-12-02 18:40:24,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:24,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170272114] [2023-12-02 18:40:24,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170272114] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:24,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907709328] [2023-12-02 18:40:24,779 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:40:24,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:24,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:24,779 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:24,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 18:40:24,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:40:24,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:24,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 18:40:24,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 539 proven. 369 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-12-02 18:40:25,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 539 proven. 369 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-12-02 18:40:25,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907709328] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:25,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [26048417] [2023-12-02 18:40:25,322 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:25,322 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:25,323 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:25,323 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:25,323 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:25,833 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:25,938 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7686#(and (<= 0 |ULTIMATE.start_foo_#res#1|) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (or (< (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) 0) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4))) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647))' at error location [2023-12-02 18:40:25,938 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:25,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:25,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 33 [2023-12-02 18:40:25,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977260732] [2023-12-02 18:40:25,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:25,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 18:40:25,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:25,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 18:40:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 18:40:25,941 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:26,947 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2023-12-02 18:40:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-02 18:40:26,948 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-12-02 18:40:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:26,949 INFO L225 Difference]: With dead ends: 122 [2023-12-02 18:40:26,949 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 18:40:26,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 247 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=965, Invalid=3865, Unknown=0, NotChecked=0, Total=4830 [2023-12-02 18:40:26,951 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:26,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:40:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 18:40:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2023-12-02 18:40:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 118 states have (on average 1.0423728813559323) internal successors, (123), 120 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2023-12-02 18:40:26,954 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 91 [2023-12-02 18:40:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:26,954 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2023-12-02 18:40:26,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2023-12-02 18:40:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-02 18:40:26,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:26,955 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 5, 5, 1, 1] [2023-12-02 18:40:26,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 18:40:27,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-02 18:40:27,156 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:27,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash -669153778, now seen corresponding path program 4 times [2023-12-02 18:40:27,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:27,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71561259] [2023-12-02 18:40:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:27,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 435 proven. 57 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2023-12-02 18:40:27,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71561259] [2023-12-02 18:40:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71561259] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624965652] [2023-12-02 18:40:27,390 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:40:27,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:27,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:27,391 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:27,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 18:40:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:27,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 18:40:27,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 435 proven. 57 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2023-12-02 18:40:27,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 435 proven. 57 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2023-12-02 18:40:27,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624965652] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:27,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1218804351] [2023-12-02 18:40:27,727 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:27,727 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:27,727 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:27,727 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:27,727 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:28,129 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:28,503 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8592#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:40:28,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:28,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2023-12-02 18:40:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790056907] [2023-12-02 18:40:28,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:28,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 18:40:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:28,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 18:40:28,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2023-12-02 18:40:28,505 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:29,191 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2023-12-02 18:40:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 18:40:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2023-12-02 18:40:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:29,193 INFO L225 Difference]: With dead ends: 143 [2023-12-02 18:40:29,193 INFO L226 Difference]: Without dead ends: 143 [2023-12-02 18:40:29,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2023-12-02 18:40:29,194 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:29,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:40:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-12-02 18:40:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-12-02 18:40:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.0857142857142856) internal successors, (152), 142 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2023-12-02 18:40:29,197 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 97 [2023-12-02 18:40:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:29,198 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2023-12-02 18:40:29,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2023-12-02 18:40:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-02 18:40:29,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:29,198 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 6, 6, 5, 1, 1] [2023-12-02 18:40:29,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 18:40:29,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 18:40:29,399 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:29,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1816871344, now seen corresponding path program 4 times [2023-12-02 18:40:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:29,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027217544] [2023-12-02 18:40:29,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 338 proven. 654 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-02 18:40:30,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:30,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027217544] [2023-12-02 18:40:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027217544] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:30,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894098746] [2023-12-02 18:40:30,091 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:40:30,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:30,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:30,092 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:30,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 18:40:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:30,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 18:40:30,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:30,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2023-12-02 18:40:30,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 18:40:30,279 INFO L378 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 10 treesize of output 8 [2023-12-02 18:40:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-12-02 18:40:30,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-12-02 18:40:31,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894098746] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [200096304] [2023-12-02 18:40:31,205 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:31,205 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:31,206 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:31,206 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:31,206 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:31,655 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:32,007 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9518#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3)) (exists ((|v_ULTIMATE.start_foo_#in~b#1.base_128| Int) (|v_ULTIMATE.start_foo_~size#1_124| Int) (|v_ULTIMATE.start_foo_#in~size#1_128| Int) (|v_ULTIMATE.start_foo_~b#1.base_134| Int)) (and (<= 1 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 1 |v_ULTIMATE.start_foo_~size#1_124|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (<= (+ |v_ULTIMATE.start_foo_~size#1_124| 1) |ULTIMATE.start_foo_#res#1|) (<= 2 |v_ULTIMATE.start_foo_~b#1.base_134|) (<= 2 |v_ULTIMATE.start_foo_#in~b#1.base_128|) (<= 1 |v_ULTIMATE.start_foo_#in~size#1_128|))) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647))' at error location [2023-12-02 18:40:32,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:32,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:32,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 6] total 26 [2023-12-02 18:40:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691174774] [2023-12-02 18:40:32,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:32,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 18:40:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 18:40:32,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2023-12-02 18:40:32,009 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand has 28 states, 27 states have (on average 4.111111111111111) internal successors, (111), 27 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:35,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:35,704 INFO L93 Difference]: Finished difference Result 492 states and 563 transitions. [2023-12-02 18:40:35,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-12-02 18:40:35,705 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.111111111111111) internal successors, (111), 27 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-12-02 18:40:35,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:35,707 INFO L225 Difference]: With dead ends: 492 [2023-12-02 18:40:35,707 INFO L226 Difference]: Without dead ends: 492 [2023-12-02 18:40:35,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4660 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1928, Invalid=12352, Unknown=0, NotChecked=0, Total=14280 [2023-12-02 18:40:35,712 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 258 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:35,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 18 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 18:40:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-12-02 18:40:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 485. [2023-12-02 18:40:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 482 states have (on average 1.1680497925311204) internal successors, (563), 484 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 563 transitions. [2023-12-02 18:40:35,725 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 563 transitions. Word has length 100 [2023-12-02 18:40:35,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:35,725 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 563 transitions. [2023-12-02 18:40:35,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.111111111111111) internal successors, (111), 27 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 563 transitions. [2023-12-02 18:40:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-02 18:40:35,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:35,726 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 34, 6, 5, 5, 1, 1] [2023-12-02 18:40:35,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 18:40:35,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 18:40:35,927 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:35,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 769614478, now seen corresponding path program 5 times [2023-12-02 18:40:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:35,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748997350] [2023-12-02 18:40:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:35,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1961 backedges. 1246 proven. 364 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2023-12-02 18:40:36,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:36,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748997350] [2023-12-02 18:40:36,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748997350] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:36,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117672634] [2023-12-02 18:40:36,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:40:36,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:36,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:36,637 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:36,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 18:40:36,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-12-02 18:40:36,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:36,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 18:40:36,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1961 backedges. 303 proven. 1034 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-12-02 18:40:37,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1961 backedges. 0 proven. 1337 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-12-02 18:40:38,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117672634] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:38,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [243706986] [2023-12-02 18:40:38,355 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:38,355 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:38,355 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:38,355 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:38,355 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:38,889 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:39,018 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11445#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:40:39,018 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:39,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:39,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13, 13] total 52 [2023-12-02 18:40:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731470410] [2023-12-02 18:40:39,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:39,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-02 18:40:39,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:39,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-02 18:40:39,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=2796, Unknown=0, NotChecked=0, Total=3192 [2023-12-02 18:40:39,022 INFO L87 Difference]: Start difference. First operand 485 states and 563 transitions. Second operand has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:43,282 INFO L93 Difference]: Finished difference Result 701 states and 813 transitions. [2023-12-02 18:40:43,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-12-02 18:40:43,282 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2023-12-02 18:40:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:43,286 INFO L225 Difference]: With dead ends: 701 [2023-12-02 18:40:43,286 INFO L226 Difference]: Without dead ends: 701 [2023-12-02 18:40:43,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3002, Invalid=11278, Unknown=0, NotChecked=0, Total=14280 [2023-12-02 18:40:43,290 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 406 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:43,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 7 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:40:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2023-12-02 18:40:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 666. [2023-12-02 18:40:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 663 states have (on average 1.1644042232277527) internal successors, (772), 665 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 772 transitions. [2023-12-02 18:40:43,301 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 772 transitions. Word has length 121 [2023-12-02 18:40:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:43,301 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 772 transitions. [2023-12-02 18:40:43,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.75) internal successors, (143), 52 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 772 transitions. [2023-12-02 18:40:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-02 18:40:43,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:43,302 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 13, 12, 12, 6, 6, 6, 1, 1, 1] [2023-12-02 18:40:43,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 18:40:43,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 18:40:43,503 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:43,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash -527197571, now seen corresponding path program 4 times [2023-12-02 18:40:43,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:43,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461181984] [2023-12-02 18:40:43,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:43,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 0 proven. 713 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2023-12-02 18:40:44,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:44,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461181984] [2023-12-02 18:40:44,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461181984] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:44,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717474839] [2023-12-02 18:40:44,156 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:40:44,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:44,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:44,157 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:44,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 18:40:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:44,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 18:40:44,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 0 proven. 1192 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-12-02 18:40:44,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 13 proven. 1128 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2023-12-02 18:40:45,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717474839] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2032905075] [2023-12-02 18:40:45,485 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 18:40:45,485 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:45,486 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:45,486 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:45,486 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:45,974 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:46,811 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13825#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3)) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|))' at error location [2023-12-02 18:40:46,811 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:46,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:46,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 15] total 50 [2023-12-02 18:40:46,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672789543] [2023-12-02 18:40:46,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:46,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 18:40:46,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:46,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 18:40:46,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=2980, Unknown=0, NotChecked=0, Total=3422 [2023-12-02 18:40:46,813 INFO L87 Difference]: Start difference. First operand 666 states and 772 transitions. Second operand has 51 states, 51 states have (on average 3.588235294117647) internal successors, (183), 50 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:49,779 INFO L93 Difference]: Finished difference Result 1351 states and 1561 transitions. [2023-12-02 18:40:49,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 18:40:49,780 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.588235294117647) internal successors, (183), 50 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2023-12-02 18:40:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:49,786 INFO L225 Difference]: With dead ends: 1351 [2023-12-02 18:40:49,786 INFO L226 Difference]: Without dead ends: 1351 [2023-12-02 18:40:49,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1322, Invalid=7234, Unknown=0, NotChecked=0, Total=8556 [2023-12-02 18:40:49,787 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 658 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 3252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:49,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 520 Invalid, 3252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 18:40:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2023-12-02 18:40:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1308. [2023-12-02 18:40:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1305 states have (on average 1.1762452107279693) internal successors, (1535), 1307 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1535 transitions. [2023-12-02 18:40:49,804 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1535 transitions. Word has length 139 [2023-12-02 18:40:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:49,804 INFO L495 AbstractCegarLoop]: Abstraction has 1308 states and 1535 transitions. [2023-12-02 18:40:49,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.588235294117647) internal successors, (183), 50 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1535 transitions. [2023-12-02 18:40:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-02 18:40:49,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:49,806 INFO L195 NwaCegarLoop]: trace histogram [63, 62, 62, 9, 8, 8, 1, 1] [2023-12-02 18:40:49,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-02 18:40:50,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:50,007 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:50,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash -701969473, now seen corresponding path program 6 times [2023-12-02 18:40:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:50,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410467519] [2023-12-02 18:40:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:50,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6393 backedges. 4206 proven. 261 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2023-12-02 18:40:50,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:50,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410467519] [2023-12-02 18:40:50,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410467519] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:50,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634163689] [2023-12-02 18:40:50,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:40:50,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:50,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:50,862 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:50,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 18:40:51,371 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:40:51,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:51,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 18:40:51,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6393 backedges. 349 proven. 5492 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-12-02 18:40:52,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:40:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6393 backedges. 349 proven. 5492 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-12-02 18:40:52,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634163689] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:40:52,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1038809013] [2023-12-02 18:40:52,709 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:40:52,709 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:40:52,709 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:40:52,710 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:40:52,710 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:40:53,018 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:40:53,426 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17901#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:40:53,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:40:53,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:40:53,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25, 25] total 63 [2023-12-02 18:40:53,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359318410] [2023-12-02 18:40:53,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:40:53,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-12-02 18:40:53,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:40:53,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-12-02 18:40:53,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4040, Unknown=0, NotChecked=0, Total=4692 [2023-12-02 18:40:53,428 INFO L87 Difference]: Start difference. First operand 1308 states and 1535 transitions. Second operand has 63 states, 63 states have (on average 3.5396825396825395) internal successors, (223), 63 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:40:58,595 INFO L93 Difference]: Finished difference Result 1037 states and 1177 transitions. [2023-12-02 18:40:58,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2023-12-02 18:40:58,596 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.5396825396825395) internal successors, (223), 63 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2023-12-02 18:40:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:40:58,601 INFO L225 Difference]: With dead ends: 1037 [2023-12-02 18:40:58,601 INFO L226 Difference]: Without dead ends: 1037 [2023-12-02 18:40:58,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 589 SyntacticMatches, 5 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22186 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7612, Invalid=54638, Unknown=0, NotChecked=0, Total=62250 [2023-12-02 18:40:58,605 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 404 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:40:58,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 3 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 18:40:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2023-12-02 18:40:58,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1036. [2023-12-02 18:40:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1033 states have (on average 1.138431752178122) internal successors, (1176), 1035 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1176 transitions. [2023-12-02 18:40:58,618 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1176 transitions. Word has length 214 [2023-12-02 18:40:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:40:58,618 INFO L495 AbstractCegarLoop]: Abstraction has 1036 states and 1176 transitions. [2023-12-02 18:40:58,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.5396825396825395) internal successors, (223), 63 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:40:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1176 transitions. [2023-12-02 18:40:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2023-12-02 18:40:58,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:40:58,620 INFO L195 NwaCegarLoop]: trace histogram [91, 91, 91, 14, 14, 13, 1, 1] [2023-12-02 18:40:58,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 18:40:58,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:58,821 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:40:58,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:40:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1054185264, now seen corresponding path program 5 times [2023-12-02 18:40:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:40:58,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046918641] [2023-12-02 18:40:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:40:58,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:40:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:40:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13832 backedges. 8507 proven. 336 refuted. 0 times theorem prover too weak. 4989 trivial. 0 not checked. [2023-12-02 18:40:59,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:40:59,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046918641] [2023-12-02 18:40:59,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046918641] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:40:59,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042147943] [2023-12-02 18:40:59,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:40:59,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:40:59,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:40:59,792 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:40:59,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 18:40:59,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:40:59,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:40:59,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 18:40:59,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:40:59,956 INFO L378 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 10 treesize of output 8 [2023-12-02 18:40:59,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:40:59,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-12-02 18:41:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13832 backedges. 13 proven. 2213 refuted. 0 times theorem prover too weak. 11606 trivial. 0 not checked. [2023-12-02 18:41:01,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:41:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13832 backedges. 0 proven. 2226 refuted. 0 times theorem prover too weak. 11606 trivial. 0 not checked. [2023-12-02 18:41:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042147943] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:41:03,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1415408246] [2023-12-02 18:41:03,726 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:41:03,726 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:41:03,726 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:41:03,726 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:41:03,726 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:41:04,249 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:41:04,401 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '22265#(and (<= 0 |ULTIMATE.start_foo_#res#1|) (= |ULTIMATE.start_main_#t~ret3#1| |ULTIMATE.start_foo_#res#1|) (or (< (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4)) 0) (< (select |#length| |ULTIMATE.start_main_~#b~0#1.base|) (+ |ULTIMATE.start_main_~#b~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4))) (<= |ULTIMATE.start_main_#t~ret3#1| 2147483647))' at error location [2023-12-02 18:41:04,401 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:41:04,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:41:04,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5, 5] total 32 [2023-12-02 18:41:04,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920448726] [2023-12-02 18:41:04,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:41:04,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 18:41:04,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:04,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 18:41:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1159, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 18:41:04,403 INFO L87 Difference]: Start difference. First operand 1036 states and 1176 transitions. Second operand has 32 states, 32 states have (on average 3.03125) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:06,630 INFO L93 Difference]: Finished difference Result 1035 states and 1142 transitions. [2023-12-02 18:41:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-02 18:41:06,630 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.03125) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2023-12-02 18:41:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:06,634 INFO L225 Difference]: With dead ends: 1035 [2023-12-02 18:41:06,634 INFO L226 Difference]: Without dead ends: 1035 [2023-12-02 18:41:06,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 936 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1114, Invalid=4436, Unknown=0, NotChecked=0, Total=5550 [2023-12-02 18:41:06,635 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:06,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:41:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2023-12-02 18:41:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2023-12-02 18:41:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1033 states have (on average 1.1055179090029041) internal successors, (1142), 1034 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1142 transitions. [2023-12-02 18:41:06,650 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1142 transitions. Word has length 316 [2023-12-02 18:41:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:06,651 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1142 transitions. [2023-12-02 18:41:06,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.03125) internal successors, (97), 32 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1142 transitions. [2023-12-02 18:41:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2023-12-02 18:41:06,653 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:06,653 INFO L195 NwaCegarLoop]: trace histogram [109, 108, 108, 14, 13, 13, 1, 1] [2023-12-02 18:41:06,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 18:41:06,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 18:41:06,854 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:41:06,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:06,854 INFO L85 PathProgramCache]: Analyzing trace with hash -123451354, now seen corresponding path program 7 times [2023-12-02 18:41:06,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:06,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360397387] [2023-12-02 18:41:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:06,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19214 backedges. 11879 proven. 420 refuted. 0 times theorem prover too weak. 6915 trivial. 0 not checked. [2023-12-02 18:41:08,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:08,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360397387] [2023-12-02 18:41:08,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360397387] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:41:08,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435650288] [2023-12-02 18:41:08,364 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:41:08,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:08,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:41:08,365 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:41:08,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-02 18:41:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:08,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 18:41:08,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:41:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 19214 backedges. 12566 proven. 1429 refuted. 0 times theorem prover too weak. 5219 trivial. 0 not checked. [2023-12-02 18:41:09,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:41:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 19214 backedges. 12566 proven. 1429 refuted. 0 times theorem prover too weak. 5219 trivial. 0 not checked. [2023-12-02 18:41:09,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435650288] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:41:09,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1294152716] [2023-12-02 18:41:09,771 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:41:09,771 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:41:09,771 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:41:09,771 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:41:09,771 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:41:10,308 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:41:10,437 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '26666#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:41:10,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:41:10,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:41:10,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 20] total 51 [2023-12-02 18:41:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058808675] [2023-12-02 18:41:10,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:41:10,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 18:41:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 18:41:10,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=2613, Unknown=0, NotChecked=0, Total=3080 [2023-12-02 18:41:10,439 INFO L87 Difference]: Start difference. First operand 1035 states and 1142 transitions. Second operand has 51 states, 51 states have (on average 3.5098039215686274) internal successors, (179), 51 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:12,930 INFO L93 Difference]: Finished difference Result 1035 states and 1123 transitions. [2023-12-02 18:41:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-12-02 18:41:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.5098039215686274) internal successors, (179), 51 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 367 [2023-12-02 18:41:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:12,935 INFO L225 Difference]: With dead ends: 1035 [2023-12-02 18:41:12,935 INFO L226 Difference]: Without dead ends: 1035 [2023-12-02 18:41:12,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1187 GetRequests, 1061 SyntacticMatches, 9 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3566 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2485, Invalid=11557, Unknown=0, NotChecked=0, Total=14042 [2023-12-02 18:41:12,936 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:12,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 18:41:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2023-12-02 18:41:12,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2023-12-02 18:41:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1033 states have (on average 1.0871248789932235) internal successors, (1123), 1034 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1123 transitions. [2023-12-02 18:41:12,952 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1123 transitions. Word has length 367 [2023-12-02 18:41:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:12,953 INFO L495 AbstractCegarLoop]: Abstraction has 1035 states and 1123 transitions. [2023-12-02 18:41:12,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.5098039215686274) internal successors, (179), 51 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1123 transitions. [2023-12-02 18:41:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2023-12-02 18:41:12,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:12,955 INFO L195 NwaCegarLoop]: trace histogram [113, 112, 112, 14, 13, 13, 1, 1] [2023-12-02 18:41:12,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-12-02 18:41:13,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:13,156 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:41:13,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1805582866, now seen corresponding path program 8 times [2023-12-02 18:41:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258340190] [2023-12-02 18:41:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 20588 backedges. 13151 proven. 513 refuted. 0 times theorem prover too weak. 6924 trivial. 0 not checked. [2023-12-02 18:41:14,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258340190] [2023-12-02 18:41:14,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258340190] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:41:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625465853] [2023-12-02 18:41:14,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:41:14,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:14,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:41:14,528 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:41:14,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 18:41:15,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-12-02 18:41:15,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:41:15,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 18:41:15,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:41:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 20588 backedges. 0 proven. 4808 refuted. 0 times theorem prover too weak. 15780 trivial. 0 not checked. [2023-12-02 18:41:15,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:41:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 20588 backedges. 0 proven. 4808 refuted. 0 times theorem prover too weak. 15780 trivial. 0 not checked. [2023-12-02 18:41:17,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625465853] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:41:17,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [170464573] [2023-12-02 18:41:17,629 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:41:17,629 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:41:17,629 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:41:17,629 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:41:17,629 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:41:17,958 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:41:18,322 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '31194#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:41:18,323 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:41:18,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:41:18,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 16] total 58 [2023-12-02 18:41:18,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633827787] [2023-12-02 18:41:18,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:41:18,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 18:41:18,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:18,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 18:41:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=3402, Unknown=0, NotChecked=0, Total=4032 [2023-12-02 18:41:18,325 INFO L87 Difference]: Start difference. First operand 1035 states and 1123 transitions. Second operand has 58 states, 58 states have (on average 3.1551724137931036) internal successors, (183), 58 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:21,986 INFO L93 Difference]: Finished difference Result 1714 states and 2008 transitions. [2023-12-02 18:41:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-12-02 18:41:21,987 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 3.1551724137931036) internal successors, (183), 58 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 379 [2023-12-02 18:41:21,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:21,992 INFO L225 Difference]: With dead ends: 1714 [2023-12-02 18:41:21,992 INFO L226 Difference]: Without dead ends: 1714 [2023-12-02 18:41:21,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1236 GetRequests, 1100 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4787 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3689, Invalid=15217, Unknown=0, NotChecked=0, Total=18906 [2023-12-02 18:41:21,994 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 264 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:21,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 18 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 18:41:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2023-12-02 18:41:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1371. [2023-12-02 18:41:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1369 states have (on average 1.1344046749452155) internal successors, (1553), 1370 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1553 transitions. [2023-12-02 18:41:22,016 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1553 transitions. Word has length 379 [2023-12-02 18:41:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:22,017 INFO L495 AbstractCegarLoop]: Abstraction has 1371 states and 1553 transitions. [2023-12-02 18:41:22,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 3.1551724137931036) internal successors, (183), 58 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1553 transitions. [2023-12-02 18:41:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2023-12-02 18:41:22,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:22,020 INFO L195 NwaCegarLoop]: trace histogram [132, 131, 131, 14, 13, 13, 1, 1] [2023-12-02 18:41:22,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-12-02 18:41:22,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-12-02 18:41:22,225 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:41:22,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash -567950563, now seen corresponding path program 9 times [2023-12-02 18:41:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:22,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960416102] [2023-12-02 18:41:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 27770 backedges. 17575 proven. 615 refuted. 0 times theorem prover too weak. 9580 trivial. 0 not checked. [2023-12-02 18:41:23,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:23,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960416102] [2023-12-02 18:41:23,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960416102] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:41:23,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979950063] [2023-12-02 18:41:23,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:41:23,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:23,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:41:23,801 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:41:23,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 18:41:25,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:41:25,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:41:25,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 1904 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 18:41:25,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:41:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 27770 backedges. 21004 proven. 2892 refuted. 0 times theorem prover too weak. 3874 trivial. 0 not checked. [2023-12-02 18:41:26,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:41:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 27770 backedges. 21004 proven. 2892 refuted. 0 times theorem prover too weak. 3874 trivial. 0 not checked. [2023-12-02 18:41:26,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979950063] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:41:26,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [551285120] [2023-12-02 18:41:26,854 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:41:26,854 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:41:26,854 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:41:26,854 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:41:26,854 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:41:27,234 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:41:27,653 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '37107#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:41:27,653 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:41:27,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:41:27,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 25] total 63 [2023-12-02 18:41:27,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606997270] [2023-12-02 18:41:27,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:41:27,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-12-02 18:41:27,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:27,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-12-02 18:41:27,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=4019, Unknown=0, NotChecked=0, Total=4692 [2023-12-02 18:41:27,656 INFO L87 Difference]: Start difference. First operand 1371 states and 1553 transitions. Second operand has 63 states, 63 states have (on average 3.619047619047619) internal successors, (228), 63 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:32,138 INFO L93 Difference]: Finished difference Result 1371 states and 1520 transitions. [2023-12-02 18:41:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-12-02 18:41:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.619047619047619) internal successors, (228), 63 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 436 [2023-12-02 18:41:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:32,144 INFO L225 Difference]: With dead ends: 1371 [2023-12-02 18:41:32,144 INFO L226 Difference]: Without dead ends: 1371 [2023-12-02 18:41:32,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1436 GetRequests, 1257 SyntacticMatches, 11 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7690 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4942, Invalid=23788, Unknown=0, NotChecked=0, Total=28730 [2023-12-02 18:41:32,146 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4626 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:32,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 4660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4626 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 18:41:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2023-12-02 18:41:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2023-12-02 18:41:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1369 states have (on average 1.110299488677867) internal successors, (1520), 1370 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1520 transitions. [2023-12-02 18:41:32,160 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1520 transitions. Word has length 436 [2023-12-02 18:41:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:32,161 INFO L495 AbstractCegarLoop]: Abstraction has 1371 states and 1520 transitions. [2023-12-02 18:41:32,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.619047619047619) internal successors, (228), 63 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1520 transitions. [2023-12-02 18:41:32,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2023-12-02 18:41:32,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:32,163 INFO L195 NwaCegarLoop]: trace histogram [135, 134, 134, 14, 13, 13, 1, 1] [2023-12-02 18:41:32,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 18:41:32,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-12-02 18:41:32,364 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:41:32,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash 646862414, now seen corresponding path program 10 times [2023-12-02 18:41:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:32,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376071081] [2023-12-02 18:41:32,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:32,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 29003 backedges. 14018 proven. 1680 refuted. 0 times theorem prover too weak. 13305 trivial. 0 not checked. [2023-12-02 18:41:35,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:35,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376071081] [2023-12-02 18:41:35,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376071081] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:41:35,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847891032] [2023-12-02 18:41:35,290 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:41:35,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:35,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:41:35,291 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:41:35,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-12-02 18:41:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:35,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-02 18:41:35,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:41:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 29003 backedges. 6014 proven. 21190 refuted. 0 times theorem prover too weak. 1799 trivial. 0 not checked. [2023-12-02 18:41:36,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:41:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 29003 backedges. 6014 proven. 21190 refuted. 0 times theorem prover too weak. 1799 trivial. 0 not checked. [2023-12-02 18:41:37,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847891032] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:41:37,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [886032911] [2023-12-02 18:41:37,715 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:41:37,715 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:41:37,715 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:41:37,715 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:41:37,715 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:41:38,316 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:41:38,520 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '42801#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:41:38,520 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:41:38,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:41:38,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 31, 31] total 79 [2023-12-02 18:41:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598310879] [2023-12-02 18:41:38,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:41:38,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2023-12-02 18:41:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:38,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2023-12-02 18:41:38,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1107, Invalid=5865, Unknown=0, NotChecked=0, Total=6972 [2023-12-02 18:41:38,523 INFO L87 Difference]: Start difference. First operand 1371 states and 1520 transitions. Second operand has 79 states, 79 states have (on average 3.518987341772152) internal successors, (278), 79 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:41,803 INFO L93 Difference]: Finished difference Result 1626 states and 1764 transitions. [2023-12-02 18:41:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2023-12-02 18:41:41,804 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 3.518987341772152) internal successors, (278), 79 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 445 [2023-12-02 18:41:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:41,811 INFO L225 Difference]: With dead ends: 1626 [2023-12-02 18:41:41,811 INFO L226 Difference]: Without dead ends: 1626 [2023-12-02 18:41:41,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1516 GetRequests, 1272 SyntacticMatches, 29 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17154 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6504, Invalid=40368, Unknown=0, NotChecked=0, Total=46872 [2023-12-02 18:41:41,814 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 120 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:41,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 4 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 18:41:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2023-12-02 18:41:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1615. [2023-12-02 18:41:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.0867947923124612) internal successors, (1753), 1614 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 1753 transitions. [2023-12-02 18:41:41,830 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 1753 transitions. Word has length 445 [2023-12-02 18:41:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:41,831 INFO L495 AbstractCegarLoop]: Abstraction has 1615 states and 1753 transitions. [2023-12-02 18:41:41,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 3.518987341772152) internal successors, (278), 79 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:41:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1753 transitions. [2023-12-02 18:41:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2023-12-02 18:41:41,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:41,833 INFO L195 NwaCegarLoop]: trace histogram [150, 149, 149, 15, 14, 14, 1, 1] [2023-12-02 18:41:41,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-12-02 18:41:42,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-02 18:41:42,034 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:41:42,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:42,034 INFO L85 PathProgramCache]: Analyzing trace with hash -316857584, now seen corresponding path program 11 times [2023-12-02 18:41:42,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:42,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163392001] [2023-12-02 18:41:42,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:42,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 35763 backedges. 16282 proven. 1814 refuted. 0 times theorem prover too weak. 17667 trivial. 0 not checked. [2023-12-02 18:41:45,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:45,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163392001] [2023-12-02 18:41:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163392001] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:41:45,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297232613] [2023-12-02 18:41:45,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:41:45,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:45,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:41:45,314 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:41:45,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 18:41:46,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2023-12-02 18:41:46,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:41:46,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 18:41:46,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:41:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 35763 backedges. 5019 proven. 11772 refuted. 0 times theorem prover too weak. 18972 trivial. 0 not checked. [2023-12-02 18:41:47,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:41:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 35763 backedges. 0 proven. 16791 refuted. 0 times theorem prover too weak. 18972 trivial. 0 not checked. [2023-12-02 18:41:49,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297232613] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:41:49,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2039663401] [2023-12-02 18:41:49,947 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:41:49,947 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:41:49,947 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:41:49,947 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:41:49,947 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:41:50,546 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:41:50,739 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '49360#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:41:50,739 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:41:50,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:41:50,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 22, 22] total 95 [2023-12-02 18:41:50,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860701959] [2023-12-02 18:41:50,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:41:50,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2023-12-02 18:41:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:50,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2023-12-02 18:41:50,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1382, Invalid=8518, Unknown=0, NotChecked=0, Total=9900 [2023-12-02 18:41:50,743 INFO L87 Difference]: Start difference. First operand 1615 states and 1753 transitions. Second operand has 95 states, 95 states have (on average 2.863157894736842) internal successors, (272), 95 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:42:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:42:06,563 INFO L93 Difference]: Finished difference Result 2530 states and 2810 transitions. [2023-12-02 18:42:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2023-12-02 18:42:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 2.863157894736842) internal successors, (272), 95 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 493 [2023-12-02 18:42:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:42:06,571 INFO L225 Difference]: With dead ends: 2530 [2023-12-02 18:42:06,571 INFO L226 Difference]: Without dead ends: 2530 [2023-12-02 18:42:06,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1667 GetRequests, 1434 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19106 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=12169, Invalid=42821, Unknown=0, NotChecked=0, Total=54990 [2023-12-02 18:42:06,574 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 703 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:42:06,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 10 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 18:42:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2023-12-02 18:42:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2311. [2023-12-02 18:42:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2311 states, 2309 states have (on average 1.0922477262884365) internal successors, (2522), 2310 states have internal predecessors, (2522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:42:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 2522 transitions. [2023-12-02 18:42:06,597 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 2522 transitions. Word has length 493 [2023-12-02 18:42:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:42:06,598 INFO L495 AbstractCegarLoop]: Abstraction has 2311 states and 2522 transitions. [2023-12-02 18:42:06,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 2.863157894736842) internal successors, (272), 95 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:42:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2522 transitions. [2023-12-02 18:42:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2023-12-02 18:42:06,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:42:06,603 INFO L195 NwaCegarLoop]: trace histogram [194, 194, 194, 20, 20, 20, 14, 13, 13, 1, 1, 1] [2023-12-02 18:42:06,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 18:42:06,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:42:06,804 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:42:06,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:42:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -248413968, now seen corresponding path program 5 times [2023-12-02 18:42:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:42:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447554751] [2023-12-02 18:42:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:42:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:42:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:42:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 60893 backedges. 36987 proven. 846 refuted. 0 times theorem prover too weak. 23060 trivial. 0 not checked. [2023-12-02 18:42:09,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:42:09,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447554751] [2023-12-02 18:42:09,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447554751] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:42:09,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211744569] [2023-12-02 18:42:09,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:42:09,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:42:09,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:42:09,419 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:42:09,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 18:42:09,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 18:42:09,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:42:09,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 18:42:09,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:42:09,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:42:09,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-02 18:42:09,734 INFO L378 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 10 treesize of output 8 [2023-12-02 18:42:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 60893 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 60855 trivial. 0 not checked. [2023-12-02 18:42:11,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:42:11,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211744569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:42:11,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:42:11,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [32] total 36 [2023-12-02 18:42:11,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248712704] [2023-12-02 18:42:11,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:42:11,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:42:11,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:42:11,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:42:11,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 18:42:11,649 INFO L87 Difference]: Start difference. First operand 2311 states and 2522 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:42:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:42:11,676 INFO L93 Difference]: Finished difference Result 2310 states and 2521 transitions. [2023-12-02 18:42:11,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:42:11,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 685 [2023-12-02 18:42:11,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:42:11,685 INFO L225 Difference]: With dead ends: 2310 [2023-12-02 18:42:11,686 INFO L226 Difference]: Without dead ends: 2269 [2023-12-02 18:42:11,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 18:42:11,686 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:42:11,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 7 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:42:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2023-12-02 18:42:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 700. [2023-12-02 18:42:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 699 states have (on average 1.0743919885550788) internal successors, (751), 699 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:42:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 751 transitions. [2023-12-02 18:42:11,700 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 751 transitions. Word has length 685 [2023-12-02 18:42:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:42:11,701 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 751 transitions. [2023-12-02 18:42:11,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:42:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 751 transitions. [2023-12-02 18:42:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2023-12-02 18:42:11,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:42:11,707 INFO L195 NwaCegarLoop]: trace histogram [214, 213, 213, 18, 17, 17, 1, 1] [2023-12-02 18:42:11,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 18:42:11,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-12-02 18:42:11,907 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:42:11,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:42:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1432021119, now seen corresponding path program 12 times [2023-12-02 18:42:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:42:11,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056577391] [2023-12-02 18:42:11,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:42:11,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:42:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:42:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 72223 backedges. 42085 proven. 1260 refuted. 0 times theorem prover too weak. 28878 trivial. 0 not checked. [2023-12-02 18:42:15,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:42:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056577391] [2023-12-02 18:42:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056577391] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:42:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096612399] [2023-12-02 18:42:15,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:42:15,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:42:15,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:42:15,207 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:42:15,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-02 18:42:22,878 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:42:22,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:42:22,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-02 18:42:22,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:42:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 72223 backedges. 1548 proven. 66604 refuted. 0 times theorem prover too weak. 4071 trivial. 0 not checked. [2023-12-02 18:42:25,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:42:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 72223 backedges. 1548 proven. 66604 refuted. 0 times theorem prover too weak. 4071 trivial. 0 not checked. [2023-12-02 18:42:27,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096612399] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:42:27,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1925636076] [2023-12-02 18:42:27,615 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:42:27,615 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:42:27,615 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:42:27,615 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:42:27,615 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:42:28,121 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:42:28,490 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '63865#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:42:28,490 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:42:28,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:42:28,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 50, 50] total 129 [2023-12-02 18:42:28,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128964555] [2023-12-02 18:42:28,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:42:28,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2023-12-02 18:42:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:42:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2023-12-02 18:42:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2674, Invalid=15148, Unknown=0, NotChecked=0, Total=17822 [2023-12-02 18:42:28,495 INFO L87 Difference]: Start difference. First operand 700 states and 751 transitions. Second operand has 129 states, 129 states have (on average 3.635658914728682) internal successors, (469), 129 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:37,627 INFO L93 Difference]: Finished difference Result 5010 states and 5326 transitions. [2023-12-02 18:43:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1294 states. [2023-12-02 18:43:37,628 INFO L78 Accepts]: Start accepts. Automaton has has 129 states, 129 states have (on average 3.635658914728682) internal successors, (469), 129 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 694 [2023-12-02 18:43:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:37,643 INFO L225 Difference]: With dead ends: 5010 [2023-12-02 18:43:37,643 INFO L226 Difference]: Without dead ends: 5010 [2023-12-02 18:43:37,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3363 GetRequests, 1980 SyntacticMatches, 7 SemanticMatches, 1376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934861 ImplicationChecksByTransitivity, 67.4s TimeCoverageRelationStatistics Valid=220148, Invalid=1677358, Unknown=0, NotChecked=0, Total=1897506 [2023-12-02 18:43:37,723 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1081 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6652 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 6652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:37,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 0 Invalid, 6773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 6652 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-02 18:43:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2023-12-02 18:43:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 3709. [2023-12-02 18:43:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3709 states, 3708 states have (on average 1.058252427184466) internal successors, (3924), 3708 states have internal predecessors, (3924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 3924 transitions. [2023-12-02 18:43:37,770 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 3924 transitions. Word has length 694 [2023-12-02 18:43:37,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:37,770 INFO L495 AbstractCegarLoop]: Abstraction has 3709 states and 3924 transitions. [2023-12-02 18:43:37,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 129 states have (on average 3.635658914728682) internal successors, (469), 129 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 3924 transitions. [2023-12-02 18:43:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1244 [2023-12-02 18:43:37,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:37,790 INFO L195 NwaCegarLoop]: trace histogram [384, 383, 383, 31, 30, 30, 1, 1] [2023-12-02 18:43:37,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-12-02 18:43:37,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-12-02 18:43:37,991 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:43:37,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:37,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2058911276, now seen corresponding path program 13 times [2023-12-02 18:43:37,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:43:37,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540307997] [2023-12-02 18:43:37,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:37,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:43:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 233080 backedges. 99474 proven. 846 refuted. 0 times theorem prover too weak. 132760 trivial. 0 not checked. [2023-12-02 18:43:43,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:43:43,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540307997] [2023-12-02 18:43:43,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540307997] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:43:43,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031484607] [2023-12-02 18:43:43,205 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:43:43,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:43:43,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:43:43,206 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:43:43,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 18:43:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:44,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 5220 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 18:43:44,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:45,097 INFO L134 CoverageAnalysis]: Checked inductivity of 233080 backedges. 104924 proven. 4015 refuted. 0 times theorem prover too weak. 124141 trivial. 0 not checked. [2023-12-02 18:43:45,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:43:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 233080 backedges. 104924 proven. 4015 refuted. 0 times theorem prover too weak. 124141 trivial. 0 not checked. [2023-12-02 18:43:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031484607] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:43:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1397111855] [2023-12-02 18:43:46,089 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:43:46,089 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:43:46,089 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:43:46,089 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:43:46,089 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:43:46,598 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:43:46,763 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '82601#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:43:46,763 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:43:46,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:43:46,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28, 28] total 71 [2023-12-02 18:43:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863337671] [2023-12-02 18:43:46,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:43:46,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-12-02 18:43:46,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:43:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-12-02 18:43:46,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=841, Invalid=4859, Unknown=0, NotChecked=0, Total=5700 [2023-12-02 18:43:46,767 INFO L87 Difference]: Start difference. First operand 3709 states and 3924 transitions. Second operand has 71 states, 71 states have (on average 3.535211267605634) internal successors, (251), 71 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:51,934 INFO L93 Difference]: Finished difference Result 3079 states and 3249 transitions. [2023-12-02 18:43:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2023-12-02 18:43:51,934 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 3.535211267605634) internal successors, (251), 71 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1243 [2023-12-02 18:43:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:51,944 INFO L225 Difference]: With dead ends: 3079 [2023-12-02 18:43:51,944 INFO L226 Difference]: Without dead ends: 3079 [2023-12-02 18:43:51,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3877 GetRequests, 3673 SyntacticMatches, 13 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9662 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6394, Invalid=30662, Unknown=0, NotChecked=0, Total=37056 [2023-12-02 18:43:51,947 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4186 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:51,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 4203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4186 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 18:43:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2023-12-02 18:43:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 3079. [2023-12-02 18:43:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3079 states, 3078 states have (on average 1.0555555555555556) internal successors, (3249), 3078 states have internal predecessors, (3249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 3249 transitions. [2023-12-02 18:43:51,979 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 3249 transitions. Word has length 1243 [2023-12-02 18:43:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:51,980 INFO L495 AbstractCegarLoop]: Abstraction has 3079 states and 3249 transitions. [2023-12-02 18:43:51,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 3.535211267605634) internal successors, (251), 71 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 3249 transitions. [2023-12-02 18:43:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1283 [2023-12-02 18:43:51,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:51,992 INFO L195 NwaCegarLoop]: trace histogram [397, 396, 396, 31, 30, 30, 1, 1] [2023-12-02 18:43:52,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 18:43:52,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-12-02 18:43:52,192 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:43:52,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:52,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1316940541, now seen corresponding path program 14 times [2023-12-02 18:43:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:43:52,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082755188] [2023-12-02 18:43:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:43:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 248667 backedges. 113466 proven. 975 refuted. 0 times theorem prover too weak. 134226 trivial. 0 not checked. [2023-12-02 18:43:57,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:43:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082755188] [2023-12-02 18:43:57,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082755188] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:43:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190054693] [2023-12-02 18:43:57,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:43:57,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:43:57,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:43:57,518 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:43:57,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 18:44:00,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2023-12-02 18:44:00,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:44:00,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 18:44:00,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 248667 backedges. 48775 proven. 36771 refuted. 0 times theorem prover too weak. 163121 trivial. 0 not checked. [2023-12-02 18:44:02,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:44:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 248667 backedges. 0 proven. 85546 refuted. 0 times theorem prover too weak. 163121 trivial. 0 not checked. [2023-12-02 18:44:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190054693] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:44:06,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [614425352] [2023-12-02 18:44:06,388 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:44:06,388 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:44:06,388 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:44:06,388 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:44:06,388 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:44:06,676 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:44:07,171 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '96769#(and (= |ULTIMATE.start_main_~#mask~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_foo_#in~size#1|) (= |ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~i~1#1|) (= |ULTIMATE.start_foo_#in~b#1.offset| 0) (<= 2 |ULTIMATE.start_foo_~b#1.base|) (<= 2 |ULTIMATE.start_main_~#b~0#1.base|) (<= 2 |ULTIMATE.start_main_~#mask~0#1.base|) (= |ULTIMATE.start_foo_~b#1.offset| 0) (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 2 |ULTIMATE.start_foo_#in~b#1.base|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:44:07,171 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:44:07,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:44:07,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 25, 25] total 84 [2023-12-02 18:44:07,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573689765] [2023-12-02 18:44:07,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:44:07,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-12-02 18:44:07,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:44:07,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-12-02 18:44:07,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1272, Invalid=6738, Unknown=0, NotChecked=0, Total=8010 [2023-12-02 18:44:07,175 INFO L87 Difference]: Start difference. First operand 3079 states and 3249 transitions. Second operand has 84 states, 84 states have (on average 2.988095238095238) internal successors, (251), 84 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:44:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:34,721 INFO L93 Difference]: Finished difference Result 5913 states and 6461 transitions. [2023-12-02 18:44:34,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 273 states. [2023-12-02 18:44:34,721 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 2.988095238095238) internal successors, (251), 84 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1282 [2023-12-02 18:44:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:34,739 INFO L225 Difference]: With dead ends: 5913 [2023-12-02 18:44:34,739 INFO L226 Difference]: Without dead ends: 5913 [2023-12-02 18:44:34,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4148 GetRequests, 3791 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44385 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=20588, Invalid=107934, Unknown=0, NotChecked=0, Total=128522 [2023-12-02 18:44:34,744 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1335 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:34,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 0 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 18:44:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5913 states. [2023-12-02 18:44:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5913 to 2908. [2023-12-02 18:44:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2907 states have (on average 1.0691434468524252) internal successors, (3108), 2907 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:44:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 3108 transitions. [2023-12-02 18:44:34,777 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 3108 transitions. Word has length 1282 [2023-12-02 18:44:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:34,778 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 3108 transitions. [2023-12-02 18:44:34,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 2.988095238095238) internal successors, (251), 84 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:44:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 3108 transitions. [2023-12-02 18:44:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1445 [2023-12-02 18:44:34,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:34,791 INFO L195 NwaCegarLoop]: trace histogram [450, 449, 449, 32, 31, 31, 1, 1] [2023-12-02 18:44:34,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 18:44:34,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-12-02 18:44:34,991 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:44:34,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash -94909755, now seen corresponding path program 15 times [2023-12-02 18:44:34,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:44:34,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538409691] [2023-12-02 18:44:34,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:44:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 318002 backedges. 144779 proven. 1113 refuted. 0 times theorem prover too weak. 172110 trivial. 0 not checked. [2023-12-02 18:44:41,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:44:41,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538409691] [2023-12-02 18:44:41,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538409691] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:44:41,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022372133] [2023-12-02 18:44:41,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:44:41,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:44:41,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:44:41,278 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:44:41,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-12-02 18:46:08,824 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:46:08,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:46:08,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 5978 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 18:46:08,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:46:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 318002 backedges. 272978 proven. 19516 refuted. 0 times theorem prover too weak. 25508 trivial. 0 not checked. [2023-12-02 18:46:10,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:46:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 318002 backedges. 272978 proven. 19516 refuted. 0 times theorem prover too weak. 25508 trivial. 0 not checked. [2023-12-02 18:46:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022372133] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:46:13,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1649441343] [2023-12-02 18:46:13,335 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:46:13,336 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:46:13,336 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:46:13,336 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:46:13,336 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:46:13,903 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:46:14,142 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '114904#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:46:14,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:46:14,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:46:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 49, 49] total 111 [2023-12-02 18:46:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739935585] [2023-12-02 18:46:14,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:46:14,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2023-12-02 18:46:14,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:46:14,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2023-12-02 18:46:14,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2042, Invalid=11298, Unknown=0, NotChecked=0, Total=13340 [2023-12-02 18:46:14,147 INFO L87 Difference]: Start difference. First operand 2908 states and 3108 transitions. Second operand has 111 states, 111 states have (on average 4.0) internal successors, (444), 111 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:46:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:46:46,153 INFO L93 Difference]: Finished difference Result 1774 states and 1815 transitions. [2023-12-02 18:46:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 464 states. [2023-12-02 18:46:46,154 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 111 states have (on average 4.0) internal successors, (444), 111 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1444 [2023-12-02 18:46:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:46:46,159 INFO L225 Difference]: With dead ends: 1774 [2023-12-02 18:46:46,159 INFO L226 Difference]: Without dead ends: 1774 [2023-12-02 18:46:46,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4800 GetRequests, 4234 SyntacticMatches, 19 SemanticMatches, 547 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85402 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=56856, Invalid=243996, Unknown=0, NotChecked=0, Total=300852 [2023-12-02 18:46:46,177 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15152 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 15184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 15152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:46:46,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 15184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 15152 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-12-02 18:46:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2023-12-02 18:46:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1774. [2023-12-02 18:46:46,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1773 states have (on average 1.023688663282572) internal successors, (1815), 1773 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:46:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 1815 transitions. [2023-12-02 18:46:46,191 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 1815 transitions. Word has length 1444 [2023-12-02 18:46:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:46:46,191 INFO L495 AbstractCegarLoop]: Abstraction has 1774 states and 1815 transitions. [2023-12-02 18:46:46,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 4.0) internal successors, (444), 111 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:46:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 1815 transitions. [2023-12-02 18:46:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1682 [2023-12-02 18:46:46,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:46:46,216 INFO L195 NwaCegarLoop]: trace histogram [529, 528, 528, 32, 31, 31, 1, 1] [2023-12-02 18:46:46,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-12-02 18:46:46,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-12-02 18:46:46,416 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:46:46,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:46:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1714993914, now seen corresponding path program 16 times [2023-12-02 18:46:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:46:46,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362642256] [2023-12-02 18:46:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:46:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:46:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:46:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 436265 backedges. 246257 proven. 2130 refuted. 0 times theorem prover too weak. 187878 trivial. 0 not checked. [2023-12-02 18:46:57,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:46:57,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362642256] [2023-12-02 18:46:57,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362642256] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:46:57,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479828457] [2023-12-02 18:46:57,136 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:46:57,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:46:57,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:46:57,137 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:46:57,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 18:46:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:46:58,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 6847 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 18:46:58,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:47:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 436265 backedges. 297437 proven. 15811 refuted. 0 times theorem prover too weak. 123017 trivial. 0 not checked. [2023-12-02 18:47:00,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:47:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 436265 backedges. 297437 proven. 15811 refuted. 0 times theorem prover too weak. 123017 trivial. 0 not checked. [2023-12-02 18:47:02,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479828457] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:47:02,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [134517046] [2023-12-02 18:47:02,481 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:47:02,481 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:47:02,481 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:47:02,481 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:47:02,481 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:47:03,043 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:47:03,267 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '129515#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:47:03,267 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:47:03,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:47:03,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44, 44] total 111 [2023-12-02 18:47:03,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997846463] [2023-12-02 18:47:03,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:47:03,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2023-12-02 18:47:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:47:03,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2023-12-02 18:47:03,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1925, Invalid=11415, Unknown=0, NotChecked=0, Total=13340 [2023-12-02 18:47:03,272 INFO L87 Difference]: Start difference. First operand 1774 states and 1815 transitions. Second operand has 111 states, 111 states have (on average 3.5585585585585586) internal successors, (395), 111 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:47:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:47:23,186 INFO L93 Difference]: Finished difference Result 1774 states and 1808 transitions. [2023-12-02 18:47:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 297 states. [2023-12-02 18:47:23,187 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 111 states have (on average 3.5585585585585586) internal successors, (395), 111 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1681 [2023-12-02 18:47:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:47:23,190 INFO L225 Difference]: With dead ends: 1774 [2023-12-02 18:47:23,191 INFO L226 Difference]: Without dead ends: 1774 [2023-12-02 18:47:23,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5363 GetRequests, 4955 SyntacticMatches, 21 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40758 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=25552, Invalid=125380, Unknown=0, NotChecked=0, Total=150932 [2023-12-02 18:47:23,199 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13937 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 13937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:47:23,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 13970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 13937 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-12-02 18:47:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2023-12-02 18:47:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1774. [2023-12-02 18:47:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1773 states have (on average 1.0197405527354766) internal successors, (1808), 1773 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:47:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 1808 transitions. [2023-12-02 18:47:23,212 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 1808 transitions. Word has length 1681 [2023-12-02 18:47:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:47:23,213 INFO L495 AbstractCegarLoop]: Abstraction has 1774 states and 1808 transitions. [2023-12-02 18:47:23,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 111 states have (on average 3.5585585585585586) internal successors, (395), 111 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:47:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 1808 transitions. [2023-12-02 18:47:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1703 [2023-12-02 18:47:23,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:47:23,270 INFO L195 NwaCegarLoop]: trace histogram [536, 535, 535, 32, 31, 31, 1, 1] [2023-12-02 18:47:23,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 18:47:23,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-12-02 18:47:23,471 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:47:23,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:47:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2074505085, now seen corresponding path program 17 times [2023-12-02 18:47:23,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:47:23,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264895860] [2023-12-02 18:47:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:47:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:47:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:47:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 447647 backedges. 256325 proven. 2331 refuted. 0 times theorem prover too weak. 188991 trivial. 0 not checked. [2023-12-02 18:47:34,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:47:34,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264895860] [2023-12-02 18:47:34,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264895860] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:47:34,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077035496] [2023-12-02 18:47:34,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:47:34,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:47:34,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:47:34,737 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:47:34,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-12-02 18:47:39,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2023-12-02 18:47:39,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:47:39,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 1558 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 18:47:39,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:47:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 447647 backedges. 0 proven. 48786 refuted. 0 times theorem prover too weak. 398861 trivial. 0 not checked. [2023-12-02 18:47:41,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:47:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 447647 backedges. 0 proven. 48786 refuted. 0 times theorem prover too weak. 398861 trivial. 0 not checked. [2023-12-02 18:47:48,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077035496] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:47:48,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1864546511] [2023-12-02 18:47:48,191 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:47:48,191 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:47:48,191 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:47:48,191 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:47:48,191 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:47:48,726 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:47:49,023 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '143935#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:47:49,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:47:49,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:47:49,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 32, 32] total 114 [2023-12-02 18:47:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840798763] [2023-12-02 18:47:49,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:47:49,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 114 states [2023-12-02 18:47:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:47:49,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2023-12-02 18:47:49,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2107, Invalid=11935, Unknown=0, NotChecked=0, Total=14042 [2023-12-02 18:47:49,028 INFO L87 Difference]: Start difference. First operand 1774 states and 1808 transitions. Second operand has 114 states, 114 states have (on average 3.0789473684210527) internal successors, (351), 114 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:47:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:47:52,972 INFO L93 Difference]: Finished difference Result 1780 states and 1808 transitions. [2023-12-02 18:47:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-12-02 18:47:52,972 INFO L78 Accepts]: Start accepts. Automaton has has 114 states, 114 states have (on average 3.0789473684210527) internal successors, (351), 114 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1702 [2023-12-02 18:47:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:47:52,975 INFO L225 Difference]: With dead ends: 1780 [2023-12-02 18:47:52,975 INFO L226 Difference]: Without dead ends: 1780 [2023-12-02 18:47:52,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5245 GetRequests, 5038 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11062 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=7576, Invalid=35896, Unknown=0, NotChecked=0, Total=43472 [2023-12-02 18:47:52,978 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:47:52,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 18:47:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2023-12-02 18:47:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1775. [2023-12-02 18:47:53,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1774 states have (on average 1.015783540022548) internal successors, (1802), 1774 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:47:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 1802 transitions. [2023-12-02 18:47:53,024 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 1802 transitions. Word has length 1702 [2023-12-02 18:47:53,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:47:53,025 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 1802 transitions. [2023-12-02 18:47:53,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 114 states, 114 states have (on average 3.0789473684210527) internal successors, (351), 114 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:47:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 1802 transitions. [2023-12-02 18:47:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1727 [2023-12-02 18:47:53,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:47:53,040 INFO L195 NwaCegarLoop]: trace histogram [544, 543, 543, 32, 31, 31, 1, 1] [2023-12-02 18:47:53,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2023-12-02 18:47:53,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2023-12-02 18:47:53,240 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:47:53,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:47:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1504574641, now seen corresponding path program 18 times [2023-12-02 18:47:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:47:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002137516] [2023-12-02 18:47:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:47:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:47:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:48:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 460835 backedges. 265245 proven. 2541 refuted. 0 times theorem prover too weak. 193049 trivial. 0 not checked. [2023-12-02 18:48:05,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:48:05,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002137516] [2023-12-02 18:48:05,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002137516] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:48:05,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178632116] [2023-12-02 18:48:05,241 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 18:48:05,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:48:05,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:48:05,242 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:48:05,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-12-02 18:49:31,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 18:49:31,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:49:31,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 7012 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-02 18:49:31,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:49:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 460835 backedges. 368338 proven. 23828 refuted. 0 times theorem prover too weak. 68669 trivial. 0 not checked. [2023-12-02 18:49:33,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:49:36,853 INFO L134 CoverageAnalysis]: Checked inductivity of 460835 backedges. 368338 proven. 23828 refuted. 0 times theorem prover too weak. 68669 trivial. 0 not checked. [2023-12-02 18:49:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178632116] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:49:36,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1509130698] [2023-12-02 18:49:36,855 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:49:36,855 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:49:36,855 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:49:36,855 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:49:36,855 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:49:37,401 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:49:37,671 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '158151#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:49:37,671 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:49:37,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:49:37,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 50, 50] total 125 [2023-12-02 18:49:37,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671624022] [2023-12-02 18:49:37,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:49:37,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2023-12-02 18:49:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:49:37,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2023-12-02 18:49:37,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2397, Invalid=14373, Unknown=0, NotChecked=0, Total=16770 [2023-12-02 18:49:37,676 INFO L87 Difference]: Start difference. First operand 1775 states and 1802 transitions. Second operand has 125 states, 125 states have (on average 3.648) internal successors, (456), 125 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:50:08,775 INFO L93 Difference]: Finished difference Result 1775 states and 1790 transitions. [2023-12-02 18:50:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 402 states. [2023-12-02 18:50:08,776 INFO L78 Accepts]: Start accepts. Automaton has has 125 states, 125 states have (on average 3.648) internal successors, (456), 125 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1726 [2023-12-02 18:50:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:50:08,778 INFO L225 Difference]: With dead ends: 1775 [2023-12-02 18:50:08,778 INFO L226 Difference]: Without dead ends: 1775 [2023-12-02 18:50:08,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5603 GetRequests, 5078 SyntacticMatches, 23 SemanticMatches, 502 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68808 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=44369, Invalid=209143, Unknown=0, NotChecked=0, Total=253512 [2023-12-02 18:50:08,789 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18312 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 18312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:50:08,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 18349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 18312 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-12-02 18:50:08,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2023-12-02 18:50:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2023-12-02 18:50:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1774 states have (on average 1.0090191657271703) internal successors, (1790), 1774 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 1790 transitions. [2023-12-02 18:50:08,801 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 1790 transitions. Word has length 1726 [2023-12-02 18:50:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:50:08,802 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 1790 transitions. [2023-12-02 18:50:08,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 3.648) internal successors, (456), 125 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:50:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 1790 transitions. [2023-12-02 18:50:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1763 [2023-12-02 18:50:08,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:50:08,818 INFO L195 NwaCegarLoop]: trace histogram [556, 555, 555, 32, 31, 31, 1, 1] [2023-12-02 18:50:08,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2023-12-02 18:50:09,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-12-02 18:50:09,018 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:50:09,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:50:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1924525763, now seen corresponding path program 19 times [2023-12-02 18:50:09,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:50:09,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855265680] [2023-12-02 18:50:09,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:50:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 480977 backedges. 263055 proven. 3225 refuted. 0 times theorem prover too weak. 214697 trivial. 0 not checked. [2023-12-02 18:50:22,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:50:22,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855265680] [2023-12-02 18:50:22,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855265680] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:50:22,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299696364] [2023-12-02 18:50:22,792 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 18:50:22,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:50:22,793 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:50:22,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 18:50:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:24,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 7144 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-02 18:50:24,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 480977 backedges. 393435 proven. 29326 refuted. 0 times theorem prover too weak. 58216 trivial. 0 not checked. [2023-12-02 18:50:27,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:50:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 480977 backedges. 393435 proven. 29326 refuted. 0 times theorem prover too weak. 58216 trivial. 0 not checked. [2023-12-02 18:50:30,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299696364] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:50:30,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1182274095] [2023-12-02 18:50:30,563 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:50:30,563 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:50:30,564 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:50:30,564 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:50:30,564 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:50:31,058 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:50:31,333 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '173157#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:50:31,333 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:50:31,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:50:31,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 54, 54] total 136 [2023-12-02 18:50:31,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313434461] [2023-12-02 18:50:31,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:50:31,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2023-12-02 18:50:31,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:50:31,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2023-12-02 18:50:31,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2830, Invalid=16910, Unknown=0, NotChecked=0, Total=19740 [2023-12-02 18:50:31,338 INFO L87 Difference]: Start difference. First operand 1775 states and 1790 transitions. Second operand has 136 states, 136 states have (on average 3.5661764705882355) internal successors, (485), 136 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:51:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:51:08,743 INFO L93 Difference]: Finished difference Result 1775 states and 1788 transitions. [2023-12-02 18:51:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 432 states. [2023-12-02 18:51:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 136 states have (on average 3.5661764705882355) internal successors, (485), 136 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1762 [2023-12-02 18:51:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:51:08,745 INFO L225 Difference]: With dead ends: 1775 [2023-12-02 18:51:08,745 INFO L226 Difference]: Without dead ends: 1775 [2023-12-02 18:51:08,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5746 GetRequests, 5178 SyntacticMatches, 26 SemanticMatches, 542 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81188 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=49762, Invalid=245630, Unknown=0, NotChecked=0, Total=295392 [2023-12-02 18:51:08,756 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22468 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 22509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 22468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:51:08,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 22509 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 22468 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-12-02 18:51:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2023-12-02 18:51:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2023-12-02 18:51:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1774 states have (on average 1.007891770011274) internal successors, (1788), 1774 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:51:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 1788 transitions. [2023-12-02 18:51:08,768 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 1788 transitions. Word has length 1762 [2023-12-02 18:51:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:51:08,768 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 1788 transitions. [2023-12-02 18:51:08,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 136 states have (on average 3.5661764705882355) internal successors, (485), 136 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:51:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 1788 transitions. [2023-12-02 18:51:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1769 [2023-12-02 18:51:08,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:51:08,785 INFO L195 NwaCegarLoop]: trace histogram [558, 557, 557, 32, 31, 31, 1, 1] [2023-12-02 18:51:08,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 18:51:08,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-12-02 18:51:08,985 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:51:08,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:51:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1820816807, now seen corresponding path program 20 times [2023-12-02 18:51:08,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:51:08,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647059428] [2023-12-02 18:51:08,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:51:08,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:51:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:51:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 484376 backedges. 252173 proven. 3471 refuted. 0 times theorem prover too weak. 228732 trivial. 0 not checked. [2023-12-02 18:51:23,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:51:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647059428] [2023-12-02 18:51:23,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647059428] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:51:23,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941631823] [2023-12-02 18:51:23,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 18:51:23,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:51:23,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:51:23,717 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:51:23,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-12-02 18:51:44,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2023-12-02 18:51:44,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:51:44,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 2358 conjuncts, 93 conjunts are in the unsatisfiable core [2023-12-02 18:51:44,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:51:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 484376 backedges. 41169 proven. 146482 refuted. 0 times theorem prover too weak. 296725 trivial. 0 not checked. [2023-12-02 18:51:49,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:51:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 484376 backedges. 168662 proven. 19271 refuted. 0 times theorem prover too weak. 296443 trivial. 0 not checked. [2023-12-02 18:51:54,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941631823] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:51:54,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1186608636] [2023-12-02 18:51:54,599 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 18:51:54,599 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:51:54,599 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:51:54,599 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:51:54,599 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:51:55,188 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:51:55,558 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '188323#(and (<= 32 (mod |ULTIMATE.start_foo_~i~0#1| 4294967296)) (<= |ULTIMATE.start_foo_~i~0#1| |ULTIMATE.start_foo_~size#1|) (<= 0 |ULTIMATE.start_foo_~i~0#1|))' at error location [2023-12-02 18:51:55,558 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:51:55,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:51:55,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 73, 75] total 202 [2023-12-02 18:51:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638960448] [2023-12-02 18:51:55,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:51:55,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2023-12-02 18:51:55,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:51:55,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2023-12-02 18:51:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5274, Invalid=37368, Unknown=0, NotChecked=0, Total=42642 [2023-12-02 18:51:55,565 INFO L87 Difference]: Start difference. First operand 1775 states and 1788 transitions. Second operand has 202 states, 202 states have (on average 2.9554455445544554) internal successors, (597), 202 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:08,884 INFO L93 Difference]: Finished difference Result 1969 states and 1984 transitions. [2023-12-02 18:52:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2023-12-02 18:52:08,884 INFO L78 Accepts]: Start accepts. Automaton has has 202 states, 202 states have (on average 2.9554455445544554) internal successors, (597), 202 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1768 [2023-12-02 18:52:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:08,886 INFO L225 Difference]: With dead ends: 1969 [2023-12-02 18:52:08,887 INFO L226 Difference]: Without dead ends: 1969 [2023-12-02 18:52:08,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5569 GetRequests, 5153 SyntacticMatches, 5 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52571 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=25657, Invalid=144499, Unknown=0, NotChecked=0, Total=170156 [2023-12-02 18:52:08,896 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 767 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4909 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 4909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:08,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 0 Invalid, 4973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 4909 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 18:52:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2023-12-02 18:52:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1874. [2023-12-02 18:52:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1873 states have (on average 1.008008542445275) internal successors, (1888), 1873 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 1888 transitions. [2023-12-02 18:52:08,908 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 1888 transitions. Word has length 1768 [2023-12-02 18:52:08,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:08,908 INFO L495 AbstractCegarLoop]: Abstraction has 1874 states and 1888 transitions. [2023-12-02 18:52:08,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 202 states, 202 states have (on average 2.9554455445544554) internal successors, (597), 202 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:52:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 1888 transitions. [2023-12-02 18:52:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1775 [2023-12-02 18:52:08,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:08,925 INFO L195 NwaCegarLoop]: trace histogram [560, 559, 559, 32, 31, 31, 1, 1] [2023-12-02 18:52:08,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-12-02 18:52:09,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:52:09,125 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-12-02 18:52:09,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash -851262911, now seen corresponding path program 21 times [2023-12-02 18:52:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:52:09,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936436740] [2023-12-02 18:52:09,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:52:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 18:52:11,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 18:52:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 18:52:14,238 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 18:52:14,238 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 18:52:14,239 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (7 of 8 remaining) [2023-12-02 18:52:14,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2023-12-02 18:52:14,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2023-12-02 18:52:14,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2023-12-02 18:52:14,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2023-12-02 18:52:14,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2023-12-02 18:52:14,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2023-12-02 18:52:14,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2023-12-02 18:52:14,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-02 18:52:14,244 INFO L445 BasicCegarLoop]: Path program histogram: [21, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:52:14,249 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 18:52:14,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:52:14 BoogieIcfgContainer [2023-12-02 18:52:14,681 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 18:52:14,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 18:52:14,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 18:52:14,682 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 18:52:14,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:39:53" (3/4) ... [2023-12-02 18:52:14,684 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 18:52:15,257 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 18:52:15,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 18:52:15,258 INFO L158 Benchmark]: Toolchain (without parser) took 742475.37ms. Allocated memory was 134.2MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 103.7MB in the beginning and 1.1GB in the end (delta: -951.4MB). Peak memory consumption was 757.1MB. Max. memory is 16.1GB. [2023-12-02 18:52:15,258 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:52:15,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.30ms. Allocated memory is still 134.2MB. Free memory was 103.5MB in the beginning and 93.7MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 18:52:15,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.27ms. Allocated memory is still 134.2MB. Free memory was 93.7MB in the beginning and 92.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:52:15,259 INFO L158 Benchmark]: Boogie Preprocessor took 22.07ms. Allocated memory is still 134.2MB. Free memory was 92.1MB in the beginning and 90.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:52:15,259 INFO L158 Benchmark]: RCFGBuilder took 346.45ms. Allocated memory is still 134.2MB. Free memory was 90.9MB in the beginning and 76.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 18:52:15,259 INFO L158 Benchmark]: TraceAbstraction took 741303.09ms. Allocated memory was 134.2MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 76.3MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-12-02 18:52:15,259 INFO L158 Benchmark]: Witness Printer took 575.78ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 92.9MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2023-12-02 18:52:15,261 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.20ms. Allocated memory is still 134.2MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.30ms. Allocated memory is still 134.2MB. Free memory was 103.5MB in the beginning and 93.7MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.27ms. Allocated memory is still 134.2MB. Free memory was 93.7MB in the beginning and 92.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.07ms. Allocated memory is still 134.2MB. Free memory was 92.1MB in the beginning and 90.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 346.45ms. Allocated memory is still 134.2MB. Free memory was 90.9MB in the beginning and 76.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 741303.09ms. Allocated memory was 134.2MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 76.3MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 575.78ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 92.9MB). Peak memory consumption was 92.3MB. 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 - CounterExampleResult [Line: 18]: array index can be out of bounds array index can be out of bounds We found a FailurePath: [L24] int i, b[32]; [L25] char mask[32]; [L26] i = 0 VAL [b={34:0}, i=0, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L17] COND TRUE i <= size VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L17] COND TRUE i <= size VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=2, size=1] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=1, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=3, size=2] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=2, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=4, size=3] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=3, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=5, size=4] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=4, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=6, size=5] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=5, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=7, size=6] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=6, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=8, size=7] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=7, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=9, size=8] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=8, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=10, size=9] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=9, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=11, size=10] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=10, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=12, size=11] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=11, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=13, size=12] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=12, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=14, size=13] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=13, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=15, size=14] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=14, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=16, size=15] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=15, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=17, size=16] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=16, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=18, size=17] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=17, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=19, size=18] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=18, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=20, size=19] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=19, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=21, size=20] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=20, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=22, size=21] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=21, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=23, size=22] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=22, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=24, size=23] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=23, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=25, size=24] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=24, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=26, size=25] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=25, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=27, size=26] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=26, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=28, size=27] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=27, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=29, size=28] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=28, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=30, size=29] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=29, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=31, size=30] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=30, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL, EXPR foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L17] COND FALSE !(i <= size) [L20] return i; [L27] RET, EXPR foo(mask, i + 1) [L27] b[i] = foo(mask, i + 1) [L26] i++ VAL [b={34:0}, i=31, mask={33:0}] [L26] COND TRUE i < sizeof(mask) [L27] CALL foo(mask, i + 1) [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L18] EXPR b[i] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] [L18] a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 740.8s, OverallIterations: 45, TraceHistogramMax: 560, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.2s, AutomataDifference: 294.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7993 SdHoareTripleChecker+Valid, 45.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7993 mSDsluCounter, 1042 SdHoareTripleChecker+Invalid, 39.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 889 mSDsCounter, 1552 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112878 IncrementalHoareTripleChecker+Invalid, 114430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1552 mSolverCounterUnsat, 153 mSDtfsCounter, 112878 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57057 GetRequests, 50211 SyntacticMatches, 207 SemanticMatches, 6639 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421914 ImplicationChecksByTransitivity, 297.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3709occurred in iteration=36, InterpolantAutomatonStates: 4928, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 6794 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.6s SsaConstructionTime, 219.9s SatisfiabilityAnalysisTime, 176.8s InterpolantComputationTime, 37268 NumberOfCodeBlocks, 31982 NumberOfCodeBlocksAsserted, 237 NumberOfCheckSat, 52371 ConstructedInterpolants, 52 QuantifiedInterpolants, 171584 SizeOfPredicates, 139 NumberOfNonLiveVariables, 53055 ConjunctsInSsa, 973 ConjunctsInUnsatCore, 118 InterpolantComputations, 8 PerfectInterpolantSequences, 9307863/10154064 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: OVERALL_TIME: 0.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 4, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 14, TOOLS_POST_TIME: 0.5s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 14, TOOLS_QUANTIFIERELIM_TIME: 0.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 28, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 4, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 34, DAG_COMPRESSION_RETAINED_NODES: 20, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-02 18:52:15,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46037e2b-0e1d-4fd1-b1da-2dfe3da108ff/bin/utaipan-verify-nQ1chXbOIh/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)