./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a 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_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 13ad8bc9cfa3954c0bae4db0509cb11733a45600a9e4ff56ca5bdd4aceeb1fc0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:58:38,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:58:38,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:58:38,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:58:38,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:58:38,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:58:38,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:58:38,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:58:38,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:58:38,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:58:38,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:58:38,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:58:38,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:58:38,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:58:38,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:58:38,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:58:38,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:58:38,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:58:38,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:58:38,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:58:38,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:58:38,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:58:38,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:58:38,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:58:38,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:58:38,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:58:38,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:58:38,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:58:38,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:58:38,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:58:38,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:58:38,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:58:38,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:58:38,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:58:38,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:58:38,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:58:38,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:58:38,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:58:38,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:58:38,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:58:38,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:58:38,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:58:38,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:58:38,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:58:38,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:58:38,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:58:38,651 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:58:38,652 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:58:38,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:58:38,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:58:38,653 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:58:38,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:58:38,655 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:58:38,655 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:58:38,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:58:38,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:58:38,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:58:38,656 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:58:38,657 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:58:38,657 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:58:38,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:58:38,657 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:58:38,658 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:58:38,658 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:58:38,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:58:38,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:58:38,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:58:38,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:58:38,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:58:38,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:58:38,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:58:38,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:58:38,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/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_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 13ad8bc9cfa3954c0bae4db0509cb11733a45600a9e4ff56ca5bdd4aceeb1fc0 [2022-11-02 20:58:38,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:58:38,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:58:38,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:58:39,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:58:39,002 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:58:39,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2022-11-02 20:58:39,076 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/data/65ba5e8da/943c9304ac064c9781b70952ce646014/FLAG6e155b6ce [2022-11-02 20:58:39,517 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:58:39,518 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2.c [2022-11-02 20:58:39,525 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/data/65ba5e8da/943c9304ac064c9781b70952ce646014/FLAG6e155b6ce [2022-11-02 20:58:39,901 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/data/65ba5e8da/943c9304ac064c9781b70952ce646014 [2022-11-02 20:58:39,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:58:39,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:58:39,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:58:39,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:58:39,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:58:39,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:58:39" (1/1) ... [2022-11-02 20:58:39,914 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15cf3d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:39, skipping insertion in model container [2022-11-02 20:58:39,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:58:39" (1/1) ... [2022-11-02 20:58:39,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:58:39,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:58:40,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:58:40,155 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:58:40,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:58:40,193 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:58:40,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40 WrapperNode [2022-11-02 20:58:40,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:58:40,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:58:40,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:58:40,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:58:40,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,228 INFO L138 Inliner]: procedures = 9, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2022-11-02 20:58:40,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:58:40,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:58:40,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:58:40,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:58:40,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,267 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:58:40,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:58:40,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:58:40,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:58:40,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (1/1) ... [2022-11-02 20:58:40,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:58:40,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:40,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:58:40,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:58:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:58:40,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:58:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:58:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:58:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:58:40,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:58:40,440 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:58:40,443 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:58:40,675 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:58:40,681 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:58:40,681 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:58:40,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:40 BoogieIcfgContainer [2022-11-02 20:58:40,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:58:40,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:58:40,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:58:40,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:58:40,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:58:39" (1/3) ... [2022-11-02 20:58:40,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b31d7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:58:40, skipping insertion in model container [2022-11-02 20:58:40,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:40" (2/3) ... [2022-11-02 20:58:40,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b31d7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:58:40, skipping insertion in model container [2022-11-02 20:58:40,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:40" (3/3) ... [2022-11-02 20:58:40,706 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2.c [2022-11-02 20:58:40,727 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:58:40,727 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-02 20:58:40,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:58:40,787 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;@796b18d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:58:40,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-02 20:58:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.75) internal successors, (49), 39 states have internal predecessors, (49), 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) [2022-11-02 20:58:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:58:40,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:40,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:58:40,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:40,807 INFO L85 PathProgramCache]: Analyzing trace with hash 28698921, now seen corresponding path program 1 times [2022-11-02 20:58:40,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:40,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271275198] [2022-11-02 20:58:40,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:40,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:41,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:41,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271275198] [2022-11-02 20:58:41,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271275198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:41,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:41,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:58:41,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085025418] [2022-11-02 20:58:41,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:41,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:58:41,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:41,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:58:41,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:58:41,277 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.75) internal successors, (49), 39 states have internal predecessors, (49), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) [2022-11-02 20:58:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:41,483 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-02 20:58:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:58:41,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 [2022-11-02 20:58:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:41,497 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:58:41,497 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 20:58:41,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:41,509 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 69 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:41,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 20:58:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2022-11-02 20:58:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 38 states have internal predecessors, (43), 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) [2022-11-02 20:58:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-02 20:58:41,544 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 5 [2022-11-02 20:58:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:41,544 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-02 20:58:41,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) [2022-11-02 20:58:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-02 20:58:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:58:41,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:41,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:41,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:58:41,546 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1809811544, now seen corresponding path program 1 times [2022-11-02 20:58:41,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:41,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095205018] [2022-11-02 20:58:41,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:41,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:41,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:41,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095205018] [2022-11-02 20:58:41,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095205018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:41,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:41,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139724811] [2022-11-02 20:58:41,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:41,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:58:41,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:58:41,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:41,709 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-11-02 20:58:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:41,812 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-02 20:58:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:58:41,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 [2022-11-02 20:58:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:41,814 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:58:41,814 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:58:41,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:58:41,816 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 81 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:41,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 116 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:41,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:58:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. [2022-11-02 20:58:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.5) internal successors, (45), 40 states have internal predecessors, (45), 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) [2022-11-02 20:58:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-11-02 20:58:41,823 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 7 [2022-11-02 20:58:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:41,823 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-11-02 20:58:41,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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) [2022-11-02 20:58:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-11-02 20:58:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:58:41,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:41,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:41,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:58:41,825 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash -489510905, now seen corresponding path program 1 times [2022-11-02 20:58:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:41,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879750180] [2022-11-02 20:58:41,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:41,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:41,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879750180] [2022-11-02 20:58:41,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879750180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:41,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:41,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515554625] [2022-11-02 20:58:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:41,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:58:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:41,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:58:41,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:41,923 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-11-02 20:58:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:41,967 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-11-02 20:58:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:58:41,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2022-11-02 20:58:41,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:41,969 INFO L225 Difference]: With dead ends: 75 [2022-11-02 20:58:41,969 INFO L226 Difference]: Without dead ends: 75 [2022-11-02 20:58:41,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:41,971 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 61 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:41,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 152 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-02 20:58:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2022-11-02 20:58:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 44 states have internal predecessors, (50), 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) [2022-11-02 20:58:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-11-02 20:58:41,978 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 11 [2022-11-02 20:58:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:41,979 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-11-02 20:58:41,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-11-02 20:58:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-11-02 20:58:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:58:41,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:41,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:41,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:58:41,980 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:41,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash -489508983, now seen corresponding path program 1 times [2022-11-02 20:58:41,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:41,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247117326] [2022-11-02 20:58:41,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:41,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:42,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:42,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247117326] [2022-11-02 20:58:42,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247117326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:42,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:42,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:42,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116594316] [2022-11-02 20:58:42,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:42,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:58:42,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:42,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:58:42,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:58:42,194 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2022-11-02 20:58:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:42,252 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-11-02 20:58:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:58:42,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-11-02 20:58:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:42,254 INFO L225 Difference]: With dead ends: 43 [2022-11-02 20:58:42,254 INFO L226 Difference]: Without dead ends: 43 [2022-11-02 20:58:42,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:58:42,256 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:42,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-02 20:58:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-02 20:58:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.411764705882353) internal successors, (48), 42 states have internal predecessors, (48), 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) [2022-11-02 20:58:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-11-02 20:58:42,261 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2022-11-02 20:58:42,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:42,262 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-11-02 20:58:42,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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) [2022-11-02 20:58:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-11-02 20:58:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:58:42,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:42,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:42,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:58:42,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash -489508982, now seen corresponding path program 1 times [2022-11-02 20:58:42,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:42,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139788103] [2022-11-02 20:58:42,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:42,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:42,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139788103] [2022-11-02 20:58:42,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139788103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:42,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:42,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:58:42,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139648146] [2022-11-02 20:58:42,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:42,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:58:42,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:58:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:42,514 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-11-02 20:58:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:42,619 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-11-02 20:58:42,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:58:42,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2022-11-02 20:58:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:42,621 INFO L225 Difference]: With dead ends: 50 [2022-11-02 20:58:42,621 INFO L226 Difference]: Without dead ends: 50 [2022-11-02 20:58:42,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:58:42,628 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:42,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-02 20:58:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-11-02 20:58:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.358974358974359) internal successors, (53), 47 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) [2022-11-02 20:58:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-02 20:58:42,646 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 11 [2022-11-02 20:58:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:42,647 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-02 20:58:42,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-11-02 20:58:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-02 20:58:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:58:42,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:42,648 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:42,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:58:42,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1675839934, now seen corresponding path program 1 times [2022-11-02 20:58:42,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:42,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112564574] [2022-11-02 20:58:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:42,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:42,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112564574] [2022-11-02 20:58:42,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112564574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:42,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:42,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:42,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308943440] [2022-11-02 20:58:42,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:42,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:58:42,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:42,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:58:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:58:42,829 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-11-02 20:58:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:42,874 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-11-02 20:58:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:58:42,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-11-02 20:58:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:42,880 INFO L225 Difference]: With dead ends: 47 [2022-11-02 20:58:42,880 INFO L226 Difference]: Without dead ends: 47 [2022-11-02 20:58:42,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:42,887 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:42,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-02 20:58:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-02 20:58:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 46 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) [2022-11-02 20:58:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-02 20:58:42,893 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2022-11-02 20:58:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:42,894 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-02 20:58:42,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-11-02 20:58:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-02 20:58:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:58:42,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:42,895 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:42,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:58:42,895 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1675839933, now seen corresponding path program 1 times [2022-11-02 20:58:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:42,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079706429] [2022-11-02 20:58:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:42,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:43,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079706429] [2022-11-02 20:58:43,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079706429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:43,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758468472] [2022-11-02 20:58:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:43,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:43,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:43,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:43,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:58:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-02 20:58:43,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:43,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 20:58:43,401 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:58:43,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:58:43,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 20:58:43,624 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:58:43,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:58:43,710 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:58:43,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:58:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:43,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:44,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-02 20:58:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:50,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758468472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:50,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:50,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 15 [2022-11-02 20:58:50,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288316563] [2022-11-02 20:58:50,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:50,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:58:50,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:50,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:58:50,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=179, Unknown=2, NotChecked=0, Total=240 [2022-11-02 20:58:50,568 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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) [2022-11-02 20:58:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:51,353 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2022-11-02 20:58:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:58:51,357 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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 16 [2022-11-02 20:58:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:51,359 INFO L225 Difference]: With dead ends: 188 [2022-11-02 20:58:51,359 INFO L226 Difference]: Without dead ends: 188 [2022-11-02 20:58:51,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=229, Invalid=639, Unknown=2, NotChecked=0, Total=870 [2022-11-02 20:58:51,360 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 389 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:51,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 139 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 150 Invalid, 0 Unknown, 205 Unchecked, 0.2s Time] [2022-11-02 20:58:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-02 20:58:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 113. [2022-11-02 20:58:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 112 states have internal predecessors, (150), 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) [2022-11-02 20:58:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 150 transitions. [2022-11-02 20:58:51,381 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 150 transitions. Word has length 16 [2022-11-02 20:58:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:51,382 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 150 transitions. [2022-11-02 20:58:51,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 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) [2022-11-02 20:58:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 150 transitions. [2022-11-02 20:58:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:58:51,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:51,384 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:51,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:51,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 20:58:51,600 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:51,601 INFO L85 PathProgramCache]: Analyzing trace with hash -411430410, now seen corresponding path program 1 times [2022-11-02 20:58:51,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:51,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675277098] [2022-11-02 20:58:51,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:51,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:51,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:51,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675277098] [2022-11-02 20:58:51,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675277098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:51,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:51,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:58:51,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912624118] [2022-11-02 20:58:51,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:51,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:58:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:51,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:58:51,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:58:51,678 INFO L87 Difference]: Start difference. First operand 113 states and 150 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-11-02 20:58:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:51,698 INFO L93 Difference]: Finished difference Result 112 states and 147 transitions. [2022-11-02 20:58:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:58:51,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 [2022-11-02 20:58:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:51,703 INFO L225 Difference]: With dead ends: 112 [2022-11-02 20:58:51,703 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:58:51,703 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 [2022-11-02 20:58:51,704 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:51,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:58:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-02 20:58:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.4) internal successors, (147), 111 states have internal predecessors, (147), 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) [2022-11-02 20:58:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 147 transitions. [2022-11-02 20:58:51,726 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 147 transitions. Word has length 17 [2022-11-02 20:58:51,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:51,727 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 147 transitions. [2022-11-02 20:58:51,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-11-02 20:58:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 147 transitions. [2022-11-02 20:58:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:58:51,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:51,728 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:51,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:58:51,729 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:51,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash -411430409, now seen corresponding path program 1 times [2022-11-02 20:58:51,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:51,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941192483] [2022-11-02 20:58:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:51,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:51,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941192483] [2022-11-02 20:58:51,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941192483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:51,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89892384] [2022-11-02 20:58:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:51,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:51,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:51,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:51,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:58:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:51,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-02 20:58:51,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:52,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 20:58:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:52,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:52,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89892384] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:52,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:52,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:58:52,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805963111] [2022-11-02 20:58:52,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:52,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:58:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:52,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:58:52,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:52,087 INFO L87 Difference]: Start difference. First operand 112 states and 147 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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) [2022-11-02 20:58:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:52,200 INFO L93 Difference]: Finished difference Result 159 states and 208 transitions. [2022-11-02 20:58:52,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:52,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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 17 [2022-11-02 20:58:52,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:52,202 INFO L225 Difference]: With dead ends: 159 [2022-11-02 20:58:52,203 INFO L226 Difference]: Without dead ends: 159 [2022-11-02 20:58:52,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:58:52,205 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 76 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:52,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 69 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-02 20:58:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2022-11-02 20:58:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 110 states have (on average 1.4) internal successors, (154), 116 states have internal predecessors, (154), 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) [2022-11-02 20:58:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2022-11-02 20:58:52,218 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 17 [2022-11-02 20:58:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:52,219 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2022-11-02 20:58:52,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 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) [2022-11-02 20:58:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2022-11-02 20:58:52,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:58:52,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:52,220 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:52,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:52,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:52,441 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:52,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:52,441 INFO L85 PathProgramCache]: Analyzing trace with hash 130511665, now seen corresponding path program 1 times [2022-11-02 20:58:52,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:52,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770719970] [2022-11-02 20:58:52,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:52,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:52,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:52,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770719970] [2022-11-02 20:58:52,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770719970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:52,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:52,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:58:52,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323508759] [2022-11-02 20:58:52,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:52,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:58:52,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:52,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:58:52,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:58:52,536 INFO L87 Difference]: Start difference. First operand 117 states and 154 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-11-02 20:58:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:52,567 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2022-11-02 20:58:52,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:58:52,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2022-11-02 20:58:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:52,569 INFO L225 Difference]: With dead ends: 116 [2022-11-02 20:58:52,569 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 20:58:52,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:52,570 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:52,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 53 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 20:58:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-11-02 20:58:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 115 states have internal predecessors, (150), 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) [2022-11-02 20:58:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2022-11-02 20:58:52,575 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 18 [2022-11-02 20:58:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:52,575 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2022-11-02 20:58:52,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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) [2022-11-02 20:58:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2022-11-02 20:58:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:58:52,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:52,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:52,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:58:52,583 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash 130511666, now seen corresponding path program 1 times [2022-11-02 20:58:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:52,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152222756] [2022-11-02 20:58:52,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:52,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:52,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:52,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152222756] [2022-11-02 20:58:52,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152222756] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:52,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233734439] [2022-11-02 20:58:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:52,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:52,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:52,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:52,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:58:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:58:52,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:52,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:52,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233734439] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:52,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:52,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-02 20:58:52,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343764686] [2022-11-02 20:58:52,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:52,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:58:52,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:52,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:58:52,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:58:52,831 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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) [2022-11-02 20:58:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:52,925 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-11-02 20:58:52,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:52,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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 18 [2022-11-02 20:58:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:52,926 INFO L225 Difference]: With dead ends: 111 [2022-11-02 20:58:52,927 INFO L226 Difference]: Without dead ends: 111 [2022-11-02 20:58:52,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:58:52,928 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 50 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:52,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 97 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:52,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-02 20:58:52,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2022-11-02 20:58:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 103 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) [2022-11-02 20:58:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-11-02 20:58:52,932 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 18 [2022-11-02 20:58:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:52,932 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-11-02 20:58:52,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 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) [2022-11-02 20:58:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-11-02 20:58:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:58:52,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:52,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:52,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:53,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:53,161 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:53,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash 624099572, now seen corresponding path program 1 times [2022-11-02 20:58:53,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:53,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087711562] [2022-11-02 20:58:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:53,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:53,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087711562] [2022-11-02 20:58:53,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087711562] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:53,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991917556] [2022-11-02 20:58:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:53,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:53,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:53,201 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:53,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:58:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:58:53,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:53,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:53,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991917556] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:53,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:53,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-02 20:58:53,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632331298] [2022-11-02 20:58:53,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:53,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:58:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:53,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:58:53,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:53,333 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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) [2022-11-02 20:58:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:53,377 INFO L93 Difference]: Finished difference Result 168 states and 201 transitions. [2022-11-02 20:58:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:53,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 20 [2022-11-02 20:58:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:53,378 INFO L225 Difference]: With dead ends: 168 [2022-11-02 20:58:53,379 INFO L226 Difference]: Without dead ends: 168 [2022-11-02 20:58:53,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:53,379 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 172 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:53,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 112 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:53,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-02 20:58:53,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2022-11-02 20:58:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 159 states have internal predecessors, (201), 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) [2022-11-02 20:58:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 201 transitions. [2022-11-02 20:58:53,384 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 201 transitions. Word has length 20 [2022-11-02 20:58:53,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:53,384 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 201 transitions. [2022-11-02 20:58:53,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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) [2022-11-02 20:58:53,384 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 201 transitions. [2022-11-02 20:58:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:58:53,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:53,385 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:53,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:53,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:58:53,609 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:53,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1752050598, now seen corresponding path program 1 times [2022-11-02 20:58:53,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:53,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296860510] [2022-11-02 20:58:53,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:53,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:53,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:53,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296860510] [2022-11-02 20:58:53,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296860510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:53,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171434305] [2022-11-02 20:58:53,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:53,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:53,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:53,697 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:53,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:58:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:53,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:58:53,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:53,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:53,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171434305] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:53,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:53,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-02 20:58:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987423400] [2022-11-02 20:58:53,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:53,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:58:53,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:53,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:58:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:58:53,910 INFO L87 Difference]: Start difference. First operand 160 states and 201 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) [2022-11-02 20:58:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:54,067 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-11-02 20:58:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:58:54,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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 21 [2022-11-02 20:58:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:54,068 INFO L225 Difference]: With dead ends: 160 [2022-11-02 20:58:54,068 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 20:58:54,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:58:54,069 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 169 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:54,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 116 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 20:58:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-11-02 20:58:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 152 states have (on average 1.2894736842105263) internal successors, (196), 157 states have internal predecessors, (196), 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) [2022-11-02 20:58:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 196 transitions. [2022-11-02 20:58:54,073 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 196 transitions. Word has length 21 [2022-11-02 20:58:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:54,073 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 196 transitions. [2022-11-02 20:58:54,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) [2022-11-02 20:58:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-11-02 20:58:54,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:58:54,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:54,074 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:54,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:54,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:58:54,274 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash -93493367, now seen corresponding path program 1 times [2022-11-02 20:58:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:54,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255602931] [2022-11-02 20:58:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:54,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:54,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255602931] [2022-11-02 20:58:54,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255602931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:54,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830719314] [2022-11-02 20:58:54,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:54,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:54,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:54,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:54,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:58:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:58:54,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:54,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:54,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2022-11-02 20:58:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:54,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830719314] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:54,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:54,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-11-02 20:58:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971957852] [2022-11-02 20:58:54,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:54,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:58:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:54,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:58:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:58:54,700 INFO L87 Difference]: Start difference. First operand 158 states and 196 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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) [2022-11-02 20:58:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:54,903 INFO L93 Difference]: Finished difference Result 220 states and 264 transitions. [2022-11-02 20:58:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:58:54,903 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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 23 [2022-11-02 20:58:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:54,904 INFO L225 Difference]: With dead ends: 220 [2022-11-02 20:58:54,904 INFO L226 Difference]: Without dead ends: 220 [2022-11-02 20:58:54,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:58:54,905 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 68 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:54,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 131 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-02 20:58:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 163. [2022-11-02 20:58:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 157 states have (on average 1.2802547770700636) internal successors, (201), 162 states have internal predecessors, (201), 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) [2022-11-02 20:58:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2022-11-02 20:58:54,910 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 23 [2022-11-02 20:58:54,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:54,911 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2022-11-02 20:58:54,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 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) [2022-11-02 20:58:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2022-11-02 20:58:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:58:54,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:54,914 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:54,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-02 20:58:55,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:58:55,126 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1409452358, now seen corresponding path program 1 times [2022-11-02 20:58:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:55,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306810819] [2022-11-02 20:58:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:55,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:55,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:55,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306810819] [2022-11-02 20:58:55,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306810819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:55,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394170501] [2022-11-02 20:58:55,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:55,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:55,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:55,232 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:55,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:58:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:55,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:58:55,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:55,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:55,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394170501] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:55,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:55,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-11-02 20:58:55,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045088673] [2022-11-02 20:58:55,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:55,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:58:55,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:55,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:58:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:58:55,442 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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) [2022-11-02 20:58:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:55,556 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2022-11-02 20:58:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:58:55,557 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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 27 [2022-11-02 20:58:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:55,557 INFO L225 Difference]: With dead ends: 158 [2022-11-02 20:58:55,557 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 20:58:55,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:58:55,558 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 71 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:55,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 105 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 20:58:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2022-11-02 20:58:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 147 states have internal predecessors, (181), 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) [2022-11-02 20:58:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2022-11-02 20:58:55,562 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 27 [2022-11-02 20:58:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:55,563 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2022-11-02 20:58:55,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 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) [2022-11-02 20:58:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2022-11-02 20:58:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:58:55,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:55,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:55,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:55,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:58:55,773 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1360755252, now seen corresponding path program 1 times [2022-11-02 20:58:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:55,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677644621] [2022-11-02 20:58:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:55,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:55,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677644621] [2022-11-02 20:58:55,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677644621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213895904] [2022-11-02 20:58:55,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:55,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:55,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:55,877 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:55,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:58:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:55,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:58:55,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:56,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:58:56,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213895904] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:56,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:56,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-02 20:58:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930951961] [2022-11-02 20:58:56,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:56,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:58:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:58:56,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:58:56,120 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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) [2022-11-02 20:58:56,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:56,308 INFO L93 Difference]: Finished difference Result 150 states and 178 transitions. [2022-11-02 20:58:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:58:56,309 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 27 [2022-11-02 20:58:56,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:56,310 INFO L225 Difference]: With dead ends: 150 [2022-11-02 20:58:56,310 INFO L226 Difference]: Without dead ends: 150 [2022-11-02 20:58:56,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:58:56,311 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 163 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:56,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 156 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-02 20:58:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-11-02 20:58:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 146 states have internal predecessors, (178), 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) [2022-11-02 20:58:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2022-11-02 20:58:56,314 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 27 [2022-11-02 20:58:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:56,314 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2022-11-02 20:58:56,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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) [2022-11-02 20:58:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2022-11-02 20:58:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:58:56,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:56,315 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:56,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:56,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:56,516 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:58:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash -144329733, now seen corresponding path program 1 times [2022-11-02 20:58:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:56,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631689396] [2022-11-02 20:58:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:58:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:56,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631689396] [2022-11-02 20:58:56,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631689396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:56,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996433281] [2022-11-02 20:58:56,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:56,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:56,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:56,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:56,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:58:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-02 20:58:56,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:57,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-11-02 20:58:57,172 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:58:57,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-11-02 20:58:57,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-02 20:58:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:58:57,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:03,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 12 [2022-11-02 20:59:03,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 20 [2022-11-02 20:59:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:59:03,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996433281] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:03,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:03,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 15] total 31 [2022-11-02 20:59:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73964776] [2022-11-02 20:59:03,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:03,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 20:59:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:03,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 20:59:03,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=834, Unknown=2, NotChecked=0, Total=930 [2022-11-02 20:59:03,705 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 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) [2022-11-02 20:59:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:04,658 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2022-11-02 20:59:04,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:59:04,659 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 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 [2022-11-02 20:59:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:04,660 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:59:04,660 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:59:04,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=344, Invalid=2204, Unknown=2, NotChecked=0, Total=2550 [2022-11-02 20:59:04,661 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 73 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:04,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 336 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 500 Invalid, 0 Unknown, 72 Unchecked, 0.3s Time] [2022-11-02 20:59:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:59:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-11-02 20:59:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 123 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) [2022-11-02 20:59:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-11-02 20:59:04,664 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 31 [2022-11-02 20:59:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:04,665 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-11-02 20:59:04,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 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) [2022-11-02 20:59:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-11-02 20:59:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:59:04,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:04,666 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:04,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:04,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:59:04,877 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:04,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2032716941, now seen corresponding path program 1 times [2022-11-02 20:59:04,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:04,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106432297] [2022-11-02 20:59:04,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:04,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:59:05,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:05,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106432297] [2022-11-02 20:59:05,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106432297] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:05,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995792049] [2022-11-02 20:59:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:05,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:05,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:05,253 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:05,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:59:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:05,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-02 20:59:05,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:05,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:05,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:59:05,531 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:59:05,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:59:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:59:05,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:07,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 49 [2022-11-02 20:59:07,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:07,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2022-11-02 20:59:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:59:08,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995792049] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:08,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:08,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-11-02 20:59:08,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844202903] [2022-11-02 20:59:08,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:08,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:59:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:59:08,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:59:08,056 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 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) [2022-11-02 20:59:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:08,594 INFO L93 Difference]: Finished difference Result 208 states and 248 transitions. [2022-11-02 20:59:08,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:59:08,594 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 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) Word has length 41 [2022-11-02 20:59:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:08,595 INFO L225 Difference]: With dead ends: 208 [2022-11-02 20:59:08,596 INFO L226 Difference]: Without dead ends: 208 [2022-11-02 20:59:08,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:59:08,597 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 188 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:08,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 194 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 229 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2022-11-02 20:59:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-02 20:59:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 99. [2022-11-02 20:59:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1914893617021276) internal successors, (112), 98 states have internal predecessors, (112), 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) [2022-11-02 20:59:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2022-11-02 20:59:08,601 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 41 [2022-11-02 20:59:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:08,601 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2022-11-02 20:59:08,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 7.117647058823529) internal successors, (121), 18 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) [2022-11-02 20:59:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-11-02 20:59:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:59:08,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:08,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:08,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:08,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:59:08,817 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:08,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:08,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1410284307, now seen corresponding path program 1 times [2022-11-02 20:59:08,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:08,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848478313] [2022-11-02 20:59:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:59:09,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:09,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848478313] [2022-11-02 20:59:09,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848478313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:09,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512059689] [2022-11-02 20:59:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:09,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:09,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:09,013 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:09,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:59:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:09,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:59:09,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:09,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 20:59:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:59:09,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:59:09,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512059689] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:09,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:09,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-02 20:59:09,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138464674] [2022-11-02 20:59:09,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:09,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:59:09,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:09,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:59:09,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:59:09,451 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 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) [2022-11-02 20:59:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:09,687 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2022-11-02 20:59:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:59:09,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 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 42 [2022-11-02 20:59:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:09,688 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:59:09,688 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:59:09,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:59:09,689 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 108 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:09,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 169 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:59:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:59:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2022-11-02 20:59:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.1875) internal successors, (114), 100 states have internal predecessors, (114), 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) [2022-11-02 20:59:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2022-11-02 20:59:09,692 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 42 [2022-11-02 20:59:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:09,692 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2022-11-02 20:59:09,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 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) [2022-11-02 20:59:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2022-11-02 20:59:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:59:09,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:09,693 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:59:09,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:09,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:09,897 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:09,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:09,897 INFO L85 PathProgramCache]: Analyzing trace with hash 183114832, now seen corresponding path program 2 times [2022-11-02 20:59:09,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:09,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309951165] [2022-11-02 20:59:09,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:09,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:59:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:10,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309951165] [2022-11-02 20:59:10,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309951165] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:10,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586514458] [2022-11-02 20:59:10,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:59:10,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:10,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:10,057 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:10,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:59:10,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:59:10,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:10,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:59:10,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:59:10,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:59:10,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586514458] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:10,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:10,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-11-02 20:59:10,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454716512] [2022-11-02 20:59:10,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:10,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:59:10,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:10,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:59:10,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:59:10,404 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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) [2022-11-02 20:59:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:10,680 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2022-11-02 20:59:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:59:10,681 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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 46 [2022-11-02 20:59:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:10,682 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:59:10,682 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 20:59:10,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:59:10,683 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 222 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:10,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 169 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:59:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 20:59:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2022-11-02 20:59:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 98 states have internal predecessors, (109), 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) [2022-11-02 20:59:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2022-11-02 20:59:10,686 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 46 [2022-11-02 20:59:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:10,686 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2022-11-02 20:59:10,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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) [2022-11-02 20:59:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2022-11-02 20:59:10,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:59:10,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:10,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-11-02 20:59:10,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:10,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:10,897 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:10,897 INFO L85 PathProgramCache]: Analyzing trace with hash 457132991, now seen corresponding path program 2 times [2022-11-02 20:59:10,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:10,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175006781] [2022-11-02 20:59:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:10,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:59:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:11,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175006781] [2022-11-02 20:59:11,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175006781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:11,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815304737] [2022-11-02 20:59:11,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:59:11,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:11,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:11,044 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:11,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:59:11,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:59:11,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:11,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:59:11,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:59:11,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:59:11,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815304737] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:11,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:11,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-02 20:59:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765534773] [2022-11-02 20:59:11,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:11,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:59:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:59:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:59:11,393 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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) [2022-11-02 20:59:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:11,554 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-11-02 20:59:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:59:11,555 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 47 [2022-11-02 20:59:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:11,555 INFO L225 Difference]: With dead ends: 101 [2022-11-02 20:59:11,555 INFO L226 Difference]: Without dead ends: 101 [2022-11-02 20:59:11,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:59:11,556 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 66 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:11,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 188 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:59:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-02 20:59:11,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-11-02 20:59:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 98 states have internal predecessors, (107), 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) [2022-11-02 20:59:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-11-02 20:59:11,560 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 47 [2022-11-02 20:59:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:11,560 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-11-02 20:59:11,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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) [2022-11-02 20:59:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-11-02 20:59:11,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:59:11,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:11,561 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-11-02 20:59:11,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-02 20:59:11,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:59:11,777 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:11,777 INFO L85 PathProgramCache]: Analyzing trace with hash -269976254, now seen corresponding path program 3 times [2022-11-02 20:59:11,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:11,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258068820] [2022-11-02 20:59:11,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:11,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:59:12,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:12,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258068820] [2022-11-02 20:59:12,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258068820] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:12,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638256143] [2022-11-02 20:59:12,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:59:12,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:12,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:12,085 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:12,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:59:12,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-02 20:59:12,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:12,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 20:59:12,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:12,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 20:59:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:59:12,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:59:12,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638256143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:12,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:12,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 17 [2022-11-02 20:59:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901602948] [2022-11-02 20:59:12,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:12,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:59:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:12,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:59:12,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:59:12,744 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 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) [2022-11-02 20:59:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:13,545 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-11-02 20:59:13,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:59:13,548 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 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) Word has length 52 [2022-11-02 20:59:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:13,549 INFO L225 Difference]: With dead ends: 128 [2022-11-02 20:59:13,549 INFO L226 Difference]: Without dead ends: 128 [2022-11-02 20:59:13,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=1071, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:59:13,551 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 199 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:13,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 188 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:59:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-02 20:59:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2022-11-02 20:59:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 95 states have internal predecessors, (103), 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) [2022-11-02 20:59:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-11-02 20:59:13,554 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 52 [2022-11-02 20:59:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:13,555 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-11-02 20:59:13,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 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) [2022-11-02 20:59:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-11-02 20:59:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:59:13,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:13,556 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-02 20:59:13,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:13,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:13,773 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:13,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1642790799, now seen corresponding path program 2 times [2022-11-02 20:59:13,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:13,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832649586] [2022-11-02 20:59:13,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:13,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:59:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:13,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832649586] [2022-11-02 20:59:13,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832649586] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:13,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103140792] [2022-11-02 20:59:13,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:59:13,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:13,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:13,978 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:13,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:59:14,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:59:14,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:14,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:59:14,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:59:14,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:59:14,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103140792] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:14,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:14,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-11-02 20:59:14,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654906629] [2022-11-02 20:59:14,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:14,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:59:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:59:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:59:14,346 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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) [2022-11-02 20:59:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:14,570 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-11-02 20:59:14,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:59:14,571 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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 56 [2022-11-02 20:59:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:14,571 INFO L225 Difference]: With dead ends: 110 [2022-11-02 20:59:14,571 INFO L226 Difference]: Without dead ends: 110 [2022-11-02 20:59:14,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:59:14,572 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 91 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:14,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 253 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:59:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-02 20:59:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2022-11-02 20:59:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.11) internal successors, (111), 103 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) [2022-11-02 20:59:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2022-11-02 20:59:14,575 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 56 [2022-11-02 20:59:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:14,575 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2022-11-02 20:59:14,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 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) [2022-11-02 20:59:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2022-11-02 20:59:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:59:14,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:14,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-02 20:59:14,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:14,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:14,777 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash 74449076, now seen corresponding path program 3 times [2022-11-02 20:59:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:14,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744273506] [2022-11-02 20:59:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:59:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:15,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744273506] [2022-11-02 20:59:15,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744273506] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:15,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763018047] [2022-11-02 20:59:15,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:59:15,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:15,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:15,461 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:15,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:59:15,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:59:15,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:15,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-02 20:59:15,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:15,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 20:59:15,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 20:59:15,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:15,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:59:15,673 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:59:15,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:59:15,803 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:59:15,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:59:15,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 20:59:16,164 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:59:16,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:59:16,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:59:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:59:16,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:21,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:21,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 85 [2022-11-02 20:59:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:59:22,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763018047] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:22,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:22,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 31 [2022-11-02 20:59:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575544857] [2022-11-02 20:59:22,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:22,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 20:59:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:22,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 20:59:22,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2022-11-02 20:59:22,406 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 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) [2022-11-02 20:59:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:23,777 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2022-11-02 20:59:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:59:23,778 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 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 60 [2022-11-02 20:59:23,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:23,779 INFO L225 Difference]: With dead ends: 166 [2022-11-02 20:59:23,779 INFO L226 Difference]: Without dead ends: 166 [2022-11-02 20:59:23,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 104 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2022-11-02 20:59:23,781 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 246 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:23,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 332 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 228 Invalid, 0 Unknown, 241 Unchecked, 0.2s Time] [2022-11-02 20:59:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-02 20:59:23,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2022-11-02 20:59:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 159 states have (on average 1.1383647798742138) internal successors, (181), 162 states have internal predecessors, (181), 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) [2022-11-02 20:59:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2022-11-02 20:59:23,785 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 60 [2022-11-02 20:59:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:23,785 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2022-11-02 20:59:23,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.064516129032258) internal successors, (157), 32 states have internal predecessors, (157), 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) [2022-11-02 20:59:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2022-11-02 20:59:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 20:59:23,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:23,786 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-11-02 20:59:23,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:24,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:24,009 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:24,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:24,009 INFO L85 PathProgramCache]: Analyzing trace with hash -809246151, now seen corresponding path program 1 times [2022-11-02 20:59:24,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:24,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974013976] [2022-11-02 20:59:24,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:24,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 33 proven. 92 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:59:24,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:24,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974013976] [2022-11-02 20:59:24,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974013976] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:24,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782493358] [2022-11-02 20:59:24,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:24,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:24,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:24,513 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:24,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:59:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:24,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:59:24,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:24,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:24,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:59:24,932 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:59:24,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:59:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 59 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:59:25,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:25,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 49 [2022-11-02 20:59:25,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:25,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2022-11-02 20:59:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 59 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:59:25,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782493358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:25,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:25,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-11-02 20:59:25,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245670731] [2022-11-02 20:59:25,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:25,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:59:25,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:25,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:59:25,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:59:25,665 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 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) [2022-11-02 20:59:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:26,396 INFO L93 Difference]: Finished difference Result 244 states and 276 transitions. [2022-11-02 20:59:26,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:59:26,397 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 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 75 [2022-11-02 20:59:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:26,398 INFO L225 Difference]: With dead ends: 244 [2022-11-02 20:59:26,398 INFO L226 Difference]: Without dead ends: 244 [2022-11-02 20:59:26,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1109, Unknown=0, NotChecked=0, Total=1406 [2022-11-02 20:59:26,399 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 250 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:26,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 472 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 492 Invalid, 0 Unknown, 28 Unchecked, 0.4s Time] [2022-11-02 20:59:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-02 20:59:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 175. [2022-11-02 20:59:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 171 states have (on average 1.1461988304093567) internal successors, (196), 174 states have internal predecessors, (196), 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) [2022-11-02 20:59:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2022-11-02 20:59:26,403 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 75 [2022-11-02 20:59:26,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:26,403 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2022-11-02 20:59:26,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 8.695652173913043) internal successors, (200), 24 states have internal predecessors, (200), 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) [2022-11-02 20:59:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2022-11-02 20:59:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:59:26,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:26,405 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-11-02 20:59:26,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-02 20:59:26,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:26,621 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:26,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash 683173057, now seen corresponding path program 1 times [2022-11-02 20:59:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:26,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071015576] [2022-11-02 20:59:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:26,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 88 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:59:26,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:26,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071015576] [2022-11-02 20:59:26,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071015576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:26,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023864956] [2022-11-02 20:59:26,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:26,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:26,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:26,923 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:26,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-02 20:59:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:27,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:59:27,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:27,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 20:59:27,294 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:59:27,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:59:27,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023864956] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:27,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:27,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-11-02 20:59:27,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277027295] [2022-11-02 20:59:27,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:27,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:59:27,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:27,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:59:27,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:59:27,522 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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) [2022-11-02 20:59:27,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:27,868 INFO L93 Difference]: Finished difference Result 223 states and 250 transitions. [2022-11-02 20:59:27,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:59:27,868 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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 [2022-11-02 20:59:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:27,869 INFO L225 Difference]: With dead ends: 223 [2022-11-02 20:59:27,869 INFO L226 Difference]: Without dead ends: 223 [2022-11-02 20:59:27,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:59:27,870 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 91 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:27,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 294 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:59:27,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-02 20:59:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 178. [2022-11-02 20:59:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 174 states have (on average 1.1436781609195403) internal successors, (199), 177 states have internal predecessors, (199), 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) [2022-11-02 20:59:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2022-11-02 20:59:27,875 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 76 [2022-11-02 20:59:27,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:27,875 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2022-11-02 20:59:27,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 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) [2022-11-02 20:59:27,876 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2022-11-02 20:59:27,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-02 20:59:27,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:27,876 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-11-02 20:59:27,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-02 20:59:28,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 20:59:28,093 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:28,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1737117148, now seen corresponding path program 2 times [2022-11-02 20:59:28,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:28,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882763366] [2022-11-02 20:59:28,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:28,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 13 proven. 137 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:59:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:28,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882763366] [2022-11-02 20:59:28,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882763366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:28,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208797144] [2022-11-02 20:59:28,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:59:28,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:28,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:28,314 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:28,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-02 20:59:28,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:59:28,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:28,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-02 20:59:28,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:59:28,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 24 proven. 126 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:59:28,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208797144] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:28,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:28,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-11-02 20:59:28,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803850251] [2022-11-02 20:59:28,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:28,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:59:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:59:28,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:59:28,868 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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) [2022-11-02 20:59:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:29,343 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2022-11-02 20:59:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:59:29,343 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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 80 [2022-11-02 20:59:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:29,347 INFO L225 Difference]: With dead ends: 220 [2022-11-02 20:59:29,348 INFO L226 Difference]: Without dead ends: 220 [2022-11-02 20:59:29,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 20:59:29,349 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 284 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:29,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 277 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:59:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-02 20:59:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 176. [2022-11-02 20:59:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.127906976744186) internal successors, (194), 175 states have internal predecessors, (194), 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) [2022-11-02 20:59:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 194 transitions. [2022-11-02 20:59:29,354 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 194 transitions. Word has length 80 [2022-11-02 20:59:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:29,354 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 194 transitions. [2022-11-02 20:59:29,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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) [2022-11-02 20:59:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 194 transitions. [2022-11-02 20:59:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-02 20:59:29,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:29,356 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-11-02 20:59:29,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:29,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:29,565 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2063647327, now seen corresponding path program 4 times [2022-11-02 20:59:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:29,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911051062] [2022-11-02 20:59:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:29,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:59:29,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:29,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911051062] [2022-11-02 20:59:29,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911051062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:29,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432579362] [2022-11-02 20:59:29,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:59:29,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:29,770 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:29,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-02 20:59:29,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:59:29,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:29,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:59:29,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 81 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:59:30,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 81 proven. 87 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:59:30,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432579362] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:59:30,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:59:30,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2022-11-02 20:59:30,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681790243] [2022-11-02 20:59:30,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:30,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:59:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:30,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:59:30,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:59:30,335 INFO L87 Difference]: Start difference. First operand 176 states and 194 transitions. Second operand has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 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) [2022-11-02 20:59:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:30,682 INFO L93 Difference]: Finished difference Result 197 states and 212 transitions. [2022-11-02 20:59:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:59:30,682 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 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) Word has length 89 [2022-11-02 20:59:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:30,683 INFO L225 Difference]: With dead ends: 197 [2022-11-02 20:59:30,684 INFO L226 Difference]: Without dead ends: 197 [2022-11-02 20:59:30,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:59:30,685 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 105 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:30,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 247 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:59:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-02 20:59:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-11-02 20:59:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 184 states have (on average 1.1032608695652173) internal successors, (203), 187 states have internal predecessors, (203), 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) [2022-11-02 20:59:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2022-11-02 20:59:30,689 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 89 [2022-11-02 20:59:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:30,690 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2022-11-02 20:59:30,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 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) [2022-11-02 20:59:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2022-11-02 20:59:30,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 20:59:30,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:59:30,691 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2022-11-02 20:59:30,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:30,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 20:59:30,909 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 20:59:30,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:59:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1513850931, now seen corresponding path program 5 times [2022-11-02 20:59:30,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:59:30,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244573318] [2022-11-02 20:59:30,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:59:30,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:59:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:59:32,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:59:32,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244573318] [2022-11-02 20:59:32,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244573318] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:32,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357272208] [2022-11-02 20:59:32,048 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:59:32,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:59:32,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:59:32,049 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:59:32,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-02 20:59:32,297 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-02 20:59:32,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:59:32,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-02 20:59:32,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:32,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:59:32,561 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:59:32,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:59:32,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-02 20:59:32,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-02 20:59:33,100 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:59:33,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:59:33,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-02 20:59:33,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-02 20:59:33,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:33,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:33,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-02 20:59:33,851 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:59:33,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:59:34,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:34,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2022-11-02 20:59:34,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:34,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:34,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:34,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:34,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2022-11-02 20:59:34,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:34,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:59:34,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2022-11-02 20:59:36,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 25 [2022-11-02 20:59:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 6 proven. 229 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:59:36,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:39,388 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:59:39,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-02 20:59:41,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (not (<= |c_ULTIMATE.start_main_#t~ret6#1| v_ArrVal_836))))))) is different from false [2022-11-02 20:59:43,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_836 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))) is different from false [2022-11-02 20:59:45,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) is different from false [2022-11-02 20:59:45,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) is different from false [2022-11-02 20:59:48,613 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:59:48,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-02 20:59:48,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (not (<= |c_ULTIMATE.start_main_#t~ret6#1| v_ArrVal_833)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-11-02 20:59:48,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_833 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-11-02 20:59:48,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 4) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse2)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))))) is different from false [2022-11-02 20:59:53,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:59:53,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 635 treesize of output 383 [2022-11-02 20:59:53,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:53,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:53,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:59:53,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 363 treesize of output 337 [2022-11-02 20:59:53,715 INFO L356 Elim1Store]: treesize reduction 27, result has 12.9 percent of original size [2022-11-02 20:59:53,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3485 treesize of output 3259 [2022-11-02 20:59:53,798 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:59:53,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-02 21:00:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 9 proven. 72 refuted. 5 times theorem prover too weak. 10 trivial. 147 not checked. [2022-11-02 21:00:04,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357272208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:00:04,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:00:04,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 41, 41] total 95 [2022-11-02 21:00:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614753027] [2022-11-02 21:00:04,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:00:04,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-11-02 21:00:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:04,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-11-02 21:00:04,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=7235, Unknown=22, NotChecked=1246, Total=8930 [2022-11-02 21:00:04,321 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand has 95 states, 95 states have (on average 2.7473684210526317) internal successors, (261), 95 states have internal predecessors, (261), 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) [2022-11-02 21:00:06,807 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse8 (+ 392 .cse5)) (.cse9 (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse5 8) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= .cse8 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 4)))) (= 400 .cse9) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 1) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (<= .cse8 .cse9)))) is different from false [2022-11-02 21:00:06,815 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse5) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 4)))) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0))) is different from false [2022-11-02 21:00:06,826 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse13)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse14 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_836))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse11)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse9 (store (select .cse8 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse10))) (or (< v_ArrVal_841 (select (select (store .cse8 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse9) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (< 0 (+ v_ArrVal_841 (select (select (store .cse8 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse9 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse10)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse12 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse13 (- 8))) 0) (or .cse14 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse13) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse12 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse13 (- 4)))) (not .cse14) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_foo_~i~1#1| 0)))) is different from false [2022-11-02 21:00:06,837 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse13)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse14 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_836))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse11)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse9 (store (select .cse8 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse10))) (or (< v_ArrVal_841 (select (select (store .cse8 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse9) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (< 0 (+ v_ArrVal_841 (select (select (store .cse8 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse9 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse10)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse12 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse13 (- 8))) 0) (or .cse14 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse13) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse12 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse13 (- 4)))) (not .cse14) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2022-11-02 21:00:06,846 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse7 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 8))) 0) (or .cse7 (and (= |c_ULTIMATE.start_main_~#b~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|) (<= (+ 392 .cse5) (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)))) (<= 1 (select .cse6 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5 (- 4)))) (not .cse7) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-11-02 21:00:06,858 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse7)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse14 (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store .cse8 .cse9 v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse7 4) v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse4))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse3) .cse4)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse13 (store .cse8 .cse9 v_ArrVal_836))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse13)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse11 (store (select .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse12))) (or (< v_ArrVal_841 (select (select (store .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse11) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2)) (< 0 (+ v_ArrVal_841 (select (select (store .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse11 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse3) .cse12)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse8 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse7 (- 8))) 0) (or (<= (+ 392 .cse7) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) .cse14) (<= 1 (select .cse8 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse7 (- 4)))) (not .cse14) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2022-11-02 21:00:06,875 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse9 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse7)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store .cse8 .cse9 v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse7 4) v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse4))) (or (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse3) .cse4)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|))))))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse13 (store .cse8 .cse9 v_ArrVal_836))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse13)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse11 (store (select .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse12))) (or (< v_ArrVal_841 (select (select (store .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse11) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2)) (< 0 (+ v_ArrVal_841 (select (select (store .cse10 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse11 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse3) .cse12)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= (select .cse8 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse7 (- 8))) 0) (or (<= (+ 392 .cse7) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_main_~#b~0#1.base|)) (<= 1 (select .cse8 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse7 (- 4)))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~size#1|) (<= 2 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2022-11-02 21:00:08,895 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 0) (<= (+ 392 .cse0) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_#res#1|) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_836 |c_ULTIMATE.start_foo_#res#1|) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|)))))) (= (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 8))) 0) (<= 1 (select .cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 4)))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-11-02 21:00:10,906 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#b~0#1.base|) 0) (<= (+ 392 .cse0) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|))) (= 2 |c_ULTIMATE.start_main_~i~2#1|) (<= |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_main_#t~ret6#1|) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 8))) 0) (<= 1 (select .cse1 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0 (- 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse5 (store .cse1 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse3 (store (select .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse4))) (or (< v_ArrVal_841 (select (select (store .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse3) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse3 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (not (<= |c_ULTIMATE.start_main_#t~ret6#1| v_ArrVal_836))))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-11-02 21:00:11,153 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse8)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse9 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ .cse8 388) .cse9) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse10 0) 0) (let ((.cse11 (+ |c_ULTIMATE.start_foo_~i~1#1| 1))) (or (< .cse11 |c_ULTIMATE.start_foo_~size#1|) (not (< |c_ULTIMATE.start_foo_~i~1#1| |c_ULTIMATE.start_foo_~size#1|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse16 (store (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse17 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse8 4) v_ArrVal_836))) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#b~0#1.base| .cse15)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse13 (store (select .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse14))) (or (< v_ArrVal_841 (select (select (store .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse13) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse13 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse14)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 .cse11))))))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 2 (select .cse10 8)) (<= 1 (select .cse10 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse9) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-11-02 21:00:11,169 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1))) (< 0 (+ 3 |c_ULTIMATE.start_main_~i~2#1| |c_ULTIMATE.start_foo_~i~1#1|)) (< 0 |c_ULTIMATE.start_main_~i~2#1|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))))) is different from false [2022-11-02 21:00:11,178 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse8)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse9 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ .cse8 388) .cse9) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse10 0) 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 2 (select .cse10 8)) (let ((.cse11 (+ |c_ULTIMATE.start_foo_~i~1#1| 1))) (or (< .cse11 |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse16 (store (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse17 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse8 4) v_ArrVal_836))) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#b~0#1.base| .cse15)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse13 (store (select .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse14))) (or (< v_ArrVal_841 (select (select (store .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse13) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse13 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse14)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 .cse11))))))))) (<= 1 (select .cse10 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse9) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-11-02 21:00:11,198 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse8 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse9)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse10 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (= |c_ULTIMATE.start_foo_#t~mem3#1| (select .cse0 (+ |c_ULTIMATE.start_foo_~b#1.offset| (* |c_ULTIMATE.start_foo_~i~1#1| 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse6 (store (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse8 v_ArrVal_836))) (let ((.cse1 (store .cse7 |c_ULTIMATE.start_main_~#b~0#1.base| .cse6)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse4))) (or (< 0 (+ (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse3) v_ArrVal_841 .cse4)) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse5)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ .cse9 388) .cse10) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 2 (select .cse0 8)) (let ((.cse11 (+ |c_ULTIMATE.start_foo_~i~1#1| 1))) (or (< .cse11 |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse16 (store (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_831))) (store .cse17 |c_ULTIMATE.start_main_~#b~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse8 v_ArrVal_833))) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse9 4) v_ArrVal_836))) (let ((.cse12 (store .cse16 |c_ULTIMATE.start_main_~#b~0#1.base| .cse15)) (.cse14 (select .cse15 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse13 (store (select .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse14))) (or (< v_ArrVal_841 (select (select (store .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse13) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse5)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< 0 (+ v_ArrVal_841 (select (select (store .cse12 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse13 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse3) .cse14)) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 .cse11))))))))) (<= 1 (select .cse0 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse10) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-11-02 21:00:11,213 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse12 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse12))) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse8)) (.cse9 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ .cse8 388) .cse9) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= .cse10 (select .cse11 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse12))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse16 (store .cse17 .cse7 v_ArrVal_836))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse16)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse14 (store (select .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse15))) (or (< v_ArrVal_841 (select (select (store .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse14) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (< 0 (+ v_ArrVal_841 (select (select (store .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse14 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse15)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (= .cse10 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 2 (select .cse11 8)) (<= 1 (select .cse11 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 0) (let ((.cse18 (+ |c_ULTIMATE.start_foo_~i~1#1| 1))) (or (< .cse18 |c_ULTIMATE.start_foo_~size#1|) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store .cse17 .cse7 v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse22 (store (select .cse23 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse8 4) v_ArrVal_836))) (let ((.cse19 (store .cse23 |c_ULTIMATE.start_main_~#b~0#1.base| .cse22)) (.cse21 (select .cse22 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse20 (store (select .cse19 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse21))) (or (< v_ArrVal_841 (select (select (store .cse19 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse20) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse19 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse20 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse21)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_833 .cse18))))))))) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse9) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-11-02 21:00:11,237 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4)))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse11 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse11)) (.cse10 (select .cse11 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse9 (store (select .cse8 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse10))) (or (< v_ArrVal_841 (select (select (store .cse8 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse9) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (< 0 (+ v_ArrVal_841 (select (select (store .cse8 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse9 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse10)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))))) is different from false [2022-11-02 21:00:11,251 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse12 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse12 (- 4)))) (.cse4 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse8)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse9 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ .cse8 388) .cse9) (= .cse10 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= .cse10 (select .cse11 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse12 (- 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse16 (store .cse17 .cse7 v_ArrVal_836))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse16)) (.cse15 (select .cse16 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse14 (store (select .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse15))) (or (< v_ArrVal_841 (select (select (store .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse14) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (< 0 (+ v_ArrVal_841 (select (select (store .cse13 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse14 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse15)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (or (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (|v_ULTIMATE.start_foo_~#a~0#1.base_65| Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int) (v_ArrVal_833 Int)) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| (store .cse17 .cse7 v_ArrVal_833)) |v_ULTIMATE.start_foo_~#a~0#1.base_65| v_ArrVal_835))) (let ((.cse21 (store (select .cse22 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse8 4) v_ArrVal_836))) (let ((.cse18 (store .cse22 |c_ULTIMATE.start_main_~#b~0#1.base| .cse21)) (.cse20 (select .cse21 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse19 (store (select .cse18 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse20))) (or (< v_ArrVal_841 (select (select (store .cse18 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse19) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_65| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< 0 (+ v_ArrVal_841 (select (select (store .cse18 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse19 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse20)) (< v_ArrVal_833 |c_ULTIMATE.start_foo_~i~1#1|) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|))))))) (< |c_ULTIMATE.start_foo_~i~1#1| |c_ULTIMATE.start_foo_~size#1|)) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 2 (select .cse11 8)) (<= 1 (select .cse11 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 1) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse9) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-11-02 21:00:11,263 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse9 (- 4)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ .cse5 388) .cse6) (= .cse7 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= .cse7 (select .cse8 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse9 (- 4)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 2 (select .cse8 8)) (<= 1 (select .cse8 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 1) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse6) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-11-02 21:00:11,271 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|) (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse7 (- 4)))) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse8 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (select .cse6 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse7)) |c_ULTIMATE.start_foo_#t~mem3#1|) (<= (+ .cse5 388) .cse8) (= .cse9 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= .cse9 (select .cse6 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse7 (- 4)))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 2 (select .cse6 8)) (<= 1 (select .cse6 4)) (= |c_ULTIMATE.start_foo_~i~1#1| 1) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse8) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-11-02 21:00:11,283 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse9 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse13 (* |c_ULTIMATE.start_foo_~i~1#1| 4))) (let ((.cse11 (select .cse18 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse13 (- 4)))) (.cse5 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse8 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse9)) (.cse0 (select .cse12 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse13))) (.cse10 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (<= 1 .cse0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse6 (store (select .cse7 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse8 v_ArrVal_836))) (let ((.cse1 (store .cse7 |c_ULTIMATE.start_main_~#b~0#1.base| .cse6)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse4))) (or (< 0 (+ (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse3) v_ArrVal_841 .cse4)) (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse5)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= (+ .cse9 388) .cse10) (= .cse11 0) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= .cse11 (select .cse12 (+ |c_ULTIMATE.start_foo_~b#1.offset| .cse13 (- 4)))) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse17 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse8 v_ArrVal_836))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse17)) (.cse16 (select .cse17 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse15 (store (select .cse14 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse16))) (or (< v_ArrVal_841 (select (select (store .cse14 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse15) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse5)) (< 0 (+ v_ArrVal_841 (select (select (store .cse14 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse15 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse3) .cse16)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (<= .cse0 (select .cse18 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| .cse13))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 2 (select .cse12 8)) (= |c_ULTIMATE.start_foo_~i~1#1| 1) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse10) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-11-02 21:00:11,302 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse11 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_foo_~#a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse11)) (.cse12 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse8 (select .cse13 (+ |c_ULTIMATE.start_foo_~b#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse8 (select .cse9 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= .cse10 0) (<= (+ .cse11 388) .cse12) (= (select .cse13 |c_ULTIMATE.start_foo_~b#1.offset|) .cse10) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse17 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse17)) (.cse16 (select .cse17 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse15 (store (select .cse14 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse16))) (or (< v_ArrVal_841 (select (select (store .cse14 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse15) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (< 0 (+ v_ArrVal_841 (select (select (store .cse14 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse15 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse16)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 2 (select .cse13 8)) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse12) (<= 1 .cse8) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-11-02 21:00:11,313 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse8 (select .cse7 |c_ULTIMATE.start_foo_~#a~0#1.offset|)) (.cse9 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|)) (.cse6 (select .cse10 (+ |c_ULTIMATE.start_foo_~b#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (<= .cse6 (select .cse7 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= .cse8 0) (<= (+ .cse5 388) .cse9) (= (select .cse10 |c_ULTIMATE.start_foo_~b#1.offset|) .cse8) (= |c_ULTIMATE.start_foo_~b#1.offset| 0) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 2 (select .cse10 8)) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse9) (<= 1 .cse6) (not (= |c_ULTIMATE.start_foo_~#a~0#1.base| |c_ULTIMATE.start_foo_~b#1.base|))))) is different from false [2022-11-02 21:00:11,322 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse6 (select .cse9 |c_ULTIMATE.start_foo_~#a~0#1.offset|)) (.cse7 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse5) v_ArrVal_836))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#b~0#1.base| .cse3)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse2))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) v_ArrVal_841 .cse2)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= .cse6 0) (<= (+ .cse5 388) .cse7) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse10 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse8 (select .cse10 4))) (and (<= .cse8 (select .cse9 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= (select .cse10 0) .cse6) (<= (select .cse10 (* |c_ULTIMATE.start_foo_~i~1#1| 4)) |c_ULTIMATE.start_foo_#t~mem3#1|) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse8) (<= 2 (select .cse10 8)))))) (= 2 |c_ULTIMATE.start_foo_~i~1#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7)))) is different from false [2022-11-02 21:00:11,334 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (.cse9 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) (.cse7 (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse9)) (.cse8 (select .cse16 |c_ULTIMATE.start_foo_~#a~0#1.offset|)) (.cse10 (select |c_#length| |c_ULTIMATE.start_foo_~b#1.base|))) (and (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_835 (Array Int Int)) (v_ArrVal_836 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base| v_ArrVal_835))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse1 (store (select .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< 0 (+ (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse1 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) v_ArrVal_841 .cse3)) (< v_ArrVal_841 (select (select (store .cse0 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse1) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|))))))) (= .cse8 0) (<= (+ .cse9 388) .cse10) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse14 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse7 v_ArrVal_836))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse14)) (.cse13 (select .cse14 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse12 (store (select .cse11 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse13))) (or (< v_ArrVal_841 (select (select (store .cse11 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse12) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse4)) (< 0 (+ v_ArrVal_841 (select (select (store .cse11 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse12 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) .cse2) .cse13)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse17 (select .cse18 4)) (.cse15 (select .cse18 8))) (and (<= .cse15 (select .cse16 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 8))) (<= .cse17 (select .cse16 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= (select .cse18 0) .cse8) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse17) (<= 2 .cse15))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (= (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|) .cse10)))) is different from false [2022-11-02 21:00:13,344 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_foo_~#a~0#1.base|))) (let ((.cse1 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse0 (select .cse7 |c_ULTIMATE.start_foo_~#a~0#1.offset|))) (and (= .cse0 0) (<= (+ .cse1 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse1) v_ArrVal_836))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse3 (store (select .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse4))) (or (< v_ArrVal_841 (select (select (store .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse3) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse3 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse9 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse8 (select .cse9 4)) (.cse6 (select .cse9 8))) (and (<= .cse6 (select .cse7 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 8))) (<= .cse8 (select .cse7 (+ |c_ULTIMATE.start_foo_~#a~0#1.offset| 4))) (= (select .cse9 0) .cse0) (not (= |ULTIMATE.start_foo_~b#1.base| |c_ULTIMATE.start_foo_~#a~0#1.base|)) (<= 1 .cse8) (<= 2 .cse6))))) (= |c_ULTIMATE.start_foo_~#a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2022-11-02 21:00:15,361 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse5 (select .cse7 0))) (and (<= (+ .cse0 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse9 (select .cse8 4)) (.cse6 (select .cse8 8))) (and (<= .cse6 (select .cse7 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse8 0) .cse5) (<= .cse9 (select .cse7 4)) (<= 1 .cse9) (<= 2 .cse6))))) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|) (= |c_ULTIMATE.start_bar_~i~0#1| 0)))) is different from false [2022-11-02 21:00:17,367 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse6 (select .cse5 0))) (and (<= (+ .cse0 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= (select .cse5 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_#t~mem1#1|) (= .cse6 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse9 (select .cse8 4)) (.cse7 (select .cse8 8))) (and (<= .cse7 (select .cse5 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse8 0) .cse6) (<= .cse9 (select .cse5 4)) (<= 1 .cse9) (<= 2 .cse7))))) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|) (= |c_ULTIMATE.start_bar_~i~0#1| 0)))) is different from false [2022-11-02 21:00:19,374 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse5 (select .cse7 0))) (and (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ .cse0 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse9 (select .cse8 4)) (.cse6 (select .cse8 8))) (and (<= .cse6 (select .cse7 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse8 0) .cse5) (<= .cse9 (select .cse7 4)) (<= 1 .cse9) (<= 2 .cse6))))) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|)))) is different from false [2022-11-02 21:00:21,380 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse6 (select .cse5 0))) (and (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ .cse0 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= (select .cse5 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_#t~mem1#1|) (= .cse6 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse9 (select .cse8 4)) (.cse7 (select .cse8 8))) (and (<= .cse7 (select .cse5 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse8 0) .cse6) (<= .cse9 (select .cse5 4)) (<= 1 .cse9) (<= 2 .cse7))))) (<= 0 |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|)))) is different from false [2022-11-02 21:00:23,386 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (let ((.cse1 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse6 (select .cse0 0))) (and (<= (select .cse0 (+ (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_~res~0#1|) (= |c_ULTIMATE.start_bar_~i~0#1| 1) (<= (+ .cse1 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse1) v_ArrVal_836))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse5)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse3 (store (select .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse4))) (or (< v_ArrVal_841 (select (select (store .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse3) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse2 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse3 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse4)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= .cse6 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse9 (select .cse8 4)) (.cse7 (select .cse8 8))) (and (<= .cse7 (select .cse0 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse8 0) .cse6) (<= .cse9 (select .cse0 4)) (<= 1 .cse9) (<= 2 .cse7))))) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|)))) is different from false [2022-11-02 21:00:25,391 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_bar_~b#1.base|))) (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse5 (select .cse7 0))) (and (= 2 |c_ULTIMATE.start_bar_~i~0#1|) (<= (+ .cse0 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (exists ((|ULTIMATE.start_foo_~b#1.base| Int)) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_foo_~b#1.base|))) (let ((.cse9 (select .cse8 4)) (.cse6 (select .cse8 8))) (and (<= .cse6 (select .cse7 8)) (not (= |c_ULTIMATE.start_bar_~b#1.base| |ULTIMATE.start_foo_~b#1.base|)) (= (select .cse8 0) .cse5) (<= .cse9 (select .cse7 4)) (<= 1 .cse9) (<= 2 .cse6))))) (<= (select .cse7 (+ (- 4) (* |c_ULTIMATE.start_bar_~i~0#1| 4) |c_ULTIMATE.start_bar_~b#1.offset|)) |c_ULTIMATE.start_bar_~res~0#1|) (= 0 |c_ULTIMATE.start_bar_~b#1.offset|)))) is different from false [2022-11-02 21:00:27,397 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (<= 1 |c_ULTIMATE.start_bar_~res~0#1|) (<= (+ .cse0 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_bar_#t~mem1#1|) (<= 3 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-11-02 21:00:29,402 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (<= (+ .cse0 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 3 |c_ULTIMATE.start_bar_~res~0#1|))) is different from false [2022-11-02 21:00:31,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (<= (+ .cse0 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-11-02 21:00:33,411 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (<= (+ .cse0 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (<= 3 |c_ULTIMATE.start_bar_#res#1|) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|))) is different from false [2022-11-02 21:00:35,416 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 4))) (and (<= (+ .cse0 388) (select |c_#length| |c_ULTIMATE.start_main_~#b~0#1.base|)) (forall ((|v_ULTIMATE.start_foo_~#a~0#1.base_64| Int) (v_ArrVal_841 Int) (v_ArrVal_836 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| .cse0) v_ArrVal_836))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| .cse4)) (.cse3 (select .cse4 |c_ULTIMATE.start_main_~#b~0#1.offset|))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64|) 0 .cse3))) (or (< v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| .cse2) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 4))) (< 0 (+ v_ArrVal_841 (select (select (store .cse1 |v_ULTIMATE.start_foo_~#a~0#1.base_64| (store .cse2 4 v_ArrVal_841)) |c_ULTIMATE.start_main_~#b~0#1.base|) (+ |c_ULTIMATE.start_main_~#b~0#1.offset| 8)) .cse3)) (= |v_ULTIMATE.start_foo_~#a~0#1.base_64| |c_ULTIMATE.start_main_~#b~0#1.base|) (< v_ArrVal_836 |c_ULTIMATE.start_foo_~size#1|)))))) (= |c_ULTIMATE.start_main_~#b~0#1.offset| 0) (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (<= 3 |c_ULTIMATE.start_foo_#t~ret4#1|))) is different from false [2022-11-02 21:00:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:37,953 INFO L93 Difference]: Finished difference Result 328 states and 354 transitions. [2022-11-02 21:00:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-02 21:00:37,954 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 2.7473684210526317) internal successors, (261), 95 states have internal predecessors, (261), 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 98 [2022-11-02 21:00:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:37,956 INFO L225 Difference]: With dead ends: 328 [2022-11-02 21:00:37,956 INFO L226 Difference]: Without dead ends: 328 [2022-11-02 21:00:37,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 161 ConstructedPredicates, 42 IntricatePredicates, 0 DeprecatedPredicates, 2933 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=836, Invalid=13795, Unknown=57, NotChecked=11718, Total=26406 [2022-11-02 21:00:37,961 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 151 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1435 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:37,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1661 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 990 Invalid, 0 Unknown, 1435 Unchecked, 0.8s Time] [2022-11-02 21:00:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-02 21:00:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 273. [2022-11-02 21:00:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 269 states have (on average 1.0929368029739777) internal successors, (294), 272 states have internal predecessors, (294), 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) [2022-11-02 21:00:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 294 transitions. [2022-11-02 21:00:37,968 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 294 transitions. Word has length 98 [2022-11-02 21:00:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:37,968 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 294 transitions. [2022-11-02 21:00:37,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 2.7473684210526317) internal successors, (261), 95 states have internal predecessors, (261), 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) [2022-11-02 21:00:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 294 transitions. [2022-11-02 21:00:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 21:00:37,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:37,969 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1] [2022-11-02 21:00:37,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-02 21:00:38,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 21:00:38,185 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 21:00:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:38,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1090204209, now seen corresponding path program 1 times [2022-11-02 21:00:38,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:38,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083974078] [2022-11-02 21:00:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:38,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:00:39,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:39,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083974078] [2022-11-02 21:00:39,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083974078] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:00:39,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014886059] [2022-11-02 21:00:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:39,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:39,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:39,265 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:39,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-02 21:00:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:39,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-02 21:00:39,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:00:39,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 21:00:39,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 21:00:39,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:00:39,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 21:00:39,504 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:00:39,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:00:39,611 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:00:39,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 21:00:39,625 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:00:39,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:00:39,832 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:00:39,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 21:00:39,848 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:00:39,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:00:40,137 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:00:40,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:00:40,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 21:00:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-02 21:00:40,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:00:46,671 WARN L234 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:00:52,752 WARN L234 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:00:52,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:52,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2022-11-02 21:00:57,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:57,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2022-11-02 21:00:59,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:00:59,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2022-11-02 21:01:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-02 21:01:01,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014886059] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:01:01,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:01:01,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 10] total 35 [2022-11-02 21:01:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451937884] [2022-11-02 21:01:01,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:01:01,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-02 21:01:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:01,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-02 21:01:01,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1046, Unknown=1, NotChecked=0, Total=1260 [2022-11-02 21:01:01,064 INFO L87 Difference]: Start difference. First operand 273 states and 294 transitions. Second operand has 36 states, 35 states have (on average 6.257142857142857) internal successors, (219), 36 states have internal predecessors, (219), 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) [2022-11-02 21:01:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:06,773 INFO L93 Difference]: Finished difference Result 355 states and 387 transitions. [2022-11-02 21:01:06,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 21:01:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 6.257142857142857) internal successors, (219), 36 states have internal predecessors, (219), 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 98 [2022-11-02 21:01:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:06,775 INFO L225 Difference]: With dead ends: 355 [2022-11-02 21:01:06,775 INFO L226 Difference]: Without dead ends: 355 [2022-11-02 21:01:06,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 180 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=455, Invalid=1896, Unknown=1, NotChecked=0, Total=2352 [2022-11-02 21:01:06,777 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 237 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:06,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 745 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 516 Invalid, 0 Unknown, 292 Unchecked, 0.3s Time] [2022-11-02 21:01:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-02 21:01:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 344. [2022-11-02 21:01:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 340 states have (on average 1.1) internal successors, (374), 343 states have internal predecessors, (374), 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) [2022-11-02 21:01:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 374 transitions. [2022-11-02 21:01:06,793 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 374 transitions. Word has length 98 [2022-11-02 21:01:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:06,793 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 374 transitions. [2022-11-02 21:01:06,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 6.257142857142857) internal successors, (219), 36 states have internal predecessors, (219), 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) [2022-11-02 21:01:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 374 transitions. [2022-11-02 21:01:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 21:01:06,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:06,795 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:06,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:07,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:07,001 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 21:01:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1637321043, now seen corresponding path program 1 times [2022-11-02 21:01:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:07,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590547593] [2022-11-02 21:01:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:07,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-02 21:01:07,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:07,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590547593] [2022-11-02 21:01:07,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590547593] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:07,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694841709] [2022-11-02 21:01:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:07,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:07,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:07,162 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:07,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-02 21:01:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:07,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 21:01:07,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-02 21:01:07,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 205 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-02 21:01:07,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694841709] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:01:07,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:01:07,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-02 21:01:07,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596376063] [2022-11-02 21:01:07,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:01:07,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 21:01:07,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:07,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:01:07,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:01:07,749 INFO L87 Difference]: Start difference. First operand 344 states and 374 transitions. Second operand has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 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) [2022-11-02 21:01:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:07,833 INFO L93 Difference]: Finished difference Result 546 states and 587 transitions. [2022-11-02 21:01:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:01:07,834 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 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 107 [2022-11-02 21:01:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:07,835 INFO L225 Difference]: With dead ends: 546 [2022-11-02 21:01:07,835 INFO L226 Difference]: Without dead ends: 546 [2022-11-02 21:01:07,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:01:07,836 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 245 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:07,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 226 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:01:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-02 21:01:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 531. [2022-11-02 21:01:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 527 states have (on average 1.113851992409867) internal successors, (587), 530 states have internal predecessors, (587), 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) [2022-11-02 21:01:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 587 transitions. [2022-11-02 21:01:07,857 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 587 transitions. Word has length 107 [2022-11-02 21:01:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:07,858 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 587 transitions. [2022-11-02 21:01:07,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 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) [2022-11-02 21:01:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 587 transitions. [2022-11-02 21:01:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-02 21:01:07,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:07,859 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1] [2022-11-02 21:01:07,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:08,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:08,085 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 21:01:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash 141914171, now seen corresponding path program 3 times [2022-11-02 21:01:08,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:08,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813346571] [2022-11-02 21:01:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:08,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 152 proven. 201 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 21:01:08,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:08,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813346571] [2022-11-02 21:01:08,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813346571] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:08,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425712019] [2022-11-02 21:01:08,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:01:08,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:08,781 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:08,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-02 21:01:08,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-02 21:01:08,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:01:08,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-02 21:01:08,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:09,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:01:09,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 21:01:09,014 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:01:09,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:01:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 137 proven. 3 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-11-02 21:01:09,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 128 proven. 12 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-11-02 21:01:09,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425712019] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:01:09,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:01:09,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2022-11-02 21:01:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626026692] [2022-11-02 21:01:09,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:01:09,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 21:01:09,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:09,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 21:01:09,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2022-11-02 21:01:09,555 INFO L87 Difference]: Start difference. First operand 531 states and 587 transitions. Second operand has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 24 states have internal predecessors, (147), 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) [2022-11-02 21:01:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:11,142 INFO L93 Difference]: Finished difference Result 784 states and 872 transitions. [2022-11-02 21:01:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 21:01:11,143 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 24 states have internal predecessors, (147), 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 118 [2022-11-02 21:01:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:11,146 INFO L225 Difference]: With dead ends: 784 [2022-11-02 21:01:11,146 INFO L226 Difference]: Without dead ends: 784 [2022-11-02 21:01:11,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=669, Invalid=2301, Unknown=0, NotChecked=0, Total=2970 [2022-11-02 21:01:11,147 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 262 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:11,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 388 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 605 Invalid, 0 Unknown, 83 Unchecked, 0.5s Time] [2022-11-02 21:01:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-11-02 21:01:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 530. [2022-11-02 21:01:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 527 states have (on average 1.096774193548387) internal successors, (578), 529 states have internal predecessors, (578), 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) [2022-11-02 21:01:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 578 transitions. [2022-11-02 21:01:11,159 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 578 transitions. Word has length 118 [2022-11-02 21:01:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:11,160 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 578 transitions. [2022-11-02 21:01:11,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 6.391304347826087) internal successors, (147), 24 states have internal predecessors, (147), 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) [2022-11-02 21:01:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 578 transitions. [2022-11-02 21:01:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-02 21:01:11,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:11,161 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1] [2022-11-02 21:01:11,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:11,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:11,369 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 21:01:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:11,369 INFO L85 PathProgramCache]: Analyzing trace with hash 104371967, now seen corresponding path program 2 times [2022-11-02 21:01:11,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:11,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582520251] [2022-11-02 21:01:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:11,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 159 proven. 194 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-02 21:01:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:11,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582520251] [2022-11-02 21:01:11,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582520251] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:11,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987091002] [2022-11-02 21:01:11,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:01:11,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:11,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:11,788 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:11,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-02 21:01:11,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 21:01:11,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:01:11,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 21:01:11,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:12,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 21:01:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-11-02 21:01:12,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2022-11-02 21:01:12,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987091002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:01:12,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:01:12,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2022-11-02 21:01:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194018584] [2022-11-02 21:01:12,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:01:12,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 21:01:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 21:01:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:01:12,893 INFO L87 Difference]: Start difference. First operand 530 states and 578 transitions. Second operand has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 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) [2022-11-02 21:01:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:13,847 INFO L93 Difference]: Finished difference Result 732 states and 798 transitions. [2022-11-02 21:01:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 21:01:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 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 119 [2022-11-02 21:01:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:13,850 INFO L225 Difference]: With dead ends: 732 [2022-11-02 21:01:13,850 INFO L226 Difference]: Without dead ends: 732 [2022-11-02 21:01:13,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2022-11-02 21:01:13,851 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 111 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:13,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 368 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:01:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2022-11-02 21:01:13,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 513. [2022-11-02 21:01:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 511 states have (on average 1.082191780821918) internal successors, (553), 512 states have internal predecessors, (553), 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) [2022-11-02 21:01:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 553 transitions. [2022-11-02 21:01:13,865 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 553 transitions. Word has length 119 [2022-11-02 21:01:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:13,865 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 553 transitions. [2022-11-02 21:01:13,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 8.555555555555555) internal successors, (154), 19 states have internal predecessors, (154), 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) [2022-11-02 21:01:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 553 transitions. [2022-11-02 21:01:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-02 21:01:13,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:13,872 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1] [2022-11-02 21:01:13,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:14,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-02 21:01:14,101 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 21:01:14,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1562413406, now seen corresponding path program 6 times [2022-11-02 21:01:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:14,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478963597] [2022-11-02 21:01:14,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:14,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 277 proven. 176 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-02 21:01:14,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:14,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478963597] [2022-11-02 21:01:14,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478963597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:14,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407922347] [2022-11-02 21:01:14,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 21:01:14,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:14,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:14,414 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:14,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-02 21:01:14,751 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-02 21:01:14,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:01:14,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 21:01:14,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 324 proven. 81 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-02 21:01:15,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 335 proven. 70 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-02 21:01:15,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407922347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:01:15,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:01:15,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-11-02 21:01:15,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507088755] [2022-11-02 21:01:15,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:01:15,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 21:01:15,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:15,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 21:01:15,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-11-02 21:01:15,246 INFO L87 Difference]: Start difference. First operand 513 states and 553 transitions. Second operand has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 22 states have internal predecessors, (170), 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) [2022-11-02 21:01:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:16,050 INFO L93 Difference]: Finished difference Result 572 states and 610 transitions. [2022-11-02 21:01:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 21:01:16,051 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 22 states have internal predecessors, (170), 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 136 [2022-11-02 21:01:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:16,053 INFO L225 Difference]: With dead ends: 572 [2022-11-02 21:01:16,053 INFO L226 Difference]: Without dead ends: 572 [2022-11-02 21:01:16,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 257 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=393, Invalid=1247, Unknown=0, NotChecked=0, Total=1640 [2022-11-02 21:01:16,054 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 160 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:16,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 370 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:01:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-11-02 21:01:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 536. [2022-11-02 21:01:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 534 states have (on average 1.0749063670411985) internal successors, (574), 535 states have internal predecessors, (574), 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) [2022-11-02 21:01:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 574 transitions. [2022-11-02 21:01:16,063 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 574 transitions. Word has length 136 [2022-11-02 21:01:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:16,064 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 574 transitions. [2022-11-02 21:01:16,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 22 states have internal predecessors, (170), 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) [2022-11-02 21:01:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 574 transitions. [2022-11-02 21:01:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-02 21:01:16,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:16,066 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1] [2022-11-02 21:01:16,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:16,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-02 21:01:16,285 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 21:01:16,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:16,286 INFO L85 PathProgramCache]: Analyzing trace with hash 188104713, now seen corresponding path program 7 times [2022-11-02 21:01:16,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:16,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761402309] [2022-11-02 21:01:16,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:16,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 179 proven. 305 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-02 21:01:16,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:16,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761402309] [2022-11-02 21:01:16,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761402309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:16,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601694921] [2022-11-02 21:01:16,689 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-02 21:01:16,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:16,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:16,691 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:16,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-02 21:01:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:16,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 21:01:16,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 225 proven. 259 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-02 21:01:17,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 225 proven. 259 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-02 21:01:17,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601694921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:01:17,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:01:17,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21 [2022-11-02 21:01:17,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653330044] [2022-11-02 21:01:17,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:01:17,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 21:01:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:17,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 21:01:17,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-11-02 21:01:17,532 INFO L87 Difference]: Start difference. First operand 536 states and 574 transitions. Second operand has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 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) [2022-11-02 21:01:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:18,029 INFO L93 Difference]: Finished difference Result 599 states and 637 transitions. [2022-11-02 21:01:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:01:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 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 141 [2022-11-02 21:01:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:18,031 INFO L225 Difference]: With dead ends: 599 [2022-11-02 21:01:18,031 INFO L226 Difference]: Without dead ends: 599 [2022-11-02 21:01:18,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 267 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2022-11-02 21:01:18,032 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 120 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:18,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 541 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:01:18,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-11-02 21:01:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 572. [2022-11-02 21:01:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 570 states have (on average 1.0701754385964912) internal successors, (610), 571 states have internal predecessors, (610), 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) [2022-11-02 21:01:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 610 transitions. [2022-11-02 21:01:18,044 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 610 transitions. Word has length 141 [2022-11-02 21:01:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:18,044 INFO L495 AbstractCegarLoop]: Abstraction has 572 states and 610 transitions. [2022-11-02 21:01:18,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.619047619047619) internal successors, (139), 21 states have internal predecessors, (139), 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) [2022-11-02 21:01:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 610 transitions. [2022-11-02 21:01:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 21:01:18,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:18,046 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1] [2022-11-02 21:01:18,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:18,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-02 21:01:18,264 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 21:01:18,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:18,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2033693772, now seen corresponding path program 8 times [2022-11-02 21:01:18,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:18,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545445572] [2022-11-02 21:01:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:18,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-02 21:01:19,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545445572] [2022-11-02 21:01:19,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545445572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574946468] [2022-11-02 21:01:19,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:01:19,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:19,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:19,877 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:19,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-02 21:01:20,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:01:20,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:01:20,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-02 21:01:20,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:20,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 21:01:20,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-11-02 21:01:20,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:01:20,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 21:01:20,177 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:01:20,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:01:20,326 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:01:20,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 21:01:20,343 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:01:20,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:01:20,571 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:01:20,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 21:01:20,587 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:01:20,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:01:20,885 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:01:20,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 21:01:20,899 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:01:20,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:01:21,303 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 21:01:21,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 21:01:21,322 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:01:21,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 21:01:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-11-02 21:01:21,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:28,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:01:28,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2022-11-02 21:01:32,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:01:32,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2022-11-02 21:01:39,411 WARN L234 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:01:39,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:01:39,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2022-11-02 21:01:46,923 WARN L234 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:01:47,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:01:47,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 67 [2022-11-02 21:01:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-11-02 21:01:47,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574946468] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:01:47,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:01:47,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 12] total 44 [2022-11-02 21:01:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683979210] [2022-11-02 21:01:47,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:01:47,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-02 21:01:47,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:47,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-02 21:01:47,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1685, Unknown=1, NotChecked=0, Total=1980 [2022-11-02 21:01:47,695 INFO L87 Difference]: Start difference. First operand 572 states and 610 transitions. Second operand has 45 states, 44 states have (on average 6.431818181818182) internal successors, (283), 45 states have internal predecessors, (283), 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) [2022-11-02 21:01:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:52,629 INFO L93 Difference]: Finished difference Result 578 states and 611 transitions. [2022-11-02 21:01:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 21:01:52,629 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 6.431818181818182) internal successors, (283), 45 states have internal predecessors, (283), 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 145 [2022-11-02 21:01:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:52,631 INFO L225 Difference]: With dead ends: 578 [2022-11-02 21:01:52,631 INFO L226 Difference]: Without dead ends: 578 [2022-11-02 21:01:52,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 277 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=804, Invalid=3751, Unknown=1, NotChecked=0, Total=4556 [2022-11-02 21:01:52,632 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 387 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:52,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 888 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 572 Invalid, 0 Unknown, 391 Unchecked, 0.4s Time] [2022-11-02 21:01:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-11-02 21:01:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 429. [2022-11-02 21:01:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 427 states have (on average 1.0608899297423888) internal successors, (453), 428 states have internal predecessors, (453), 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) [2022-11-02 21:01:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 453 transitions. [2022-11-02 21:01:52,641 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 453 transitions. Word has length 145 [2022-11-02 21:01:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:52,641 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 453 transitions. [2022-11-02 21:01:52,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 6.431818181818182) internal successors, (283), 45 states have internal predecessors, (283), 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) [2022-11-02 21:01:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 453 transitions. [2022-11-02 21:01:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2022-11-02 21:01:52,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:52,648 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 2, 1, 1, 1] [2022-11-02 21:01:52,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-11-02 21:01:52,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-02 21:01:52,861 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 21:01:52,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash 65158635, now seen corresponding path program 9 times [2022-11-02 21:01:52,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:52,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860767597] [2022-11-02 21:01:52,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:52,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 2039 proven. 150 refuted. 0 times theorem prover too weak. 2803 trivial. 0 not checked. [2022-11-02 21:01:53,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:53,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860767597] [2022-11-02 21:01:53,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860767597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:53,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935142921] [2022-11-02 21:01:53,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:01:53,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:53,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:53,761 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:53,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-02 21:01:54,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-02 21:01:54,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:01:54,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 21:01:54,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 1579 proven. 2530 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2022-11-02 21:01:54,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:01:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 1579 proven. 2530 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2022-11-02 21:01:55,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935142921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:01:55,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:01:55,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 25 [2022-11-02 21:01:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705202451] [2022-11-02 21:01:55,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:01:55,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:01:55,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:55,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:01:55,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2022-11-02 21:01:55,589 INFO L87 Difference]: Start difference. First operand 429 states and 453 transitions. Second operand has 25 states, 25 states have (on average 9.16) internal successors, (229), 25 states have internal predecessors, (229), 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) [2022-11-02 21:01:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:56,490 INFO L93 Difference]: Finished difference Result 474 states and 498 transitions. [2022-11-02 21:01:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 21:01:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.16) internal successors, (229), 25 states have internal predecessors, (229), 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 380 [2022-11-02 21:01:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:56,493 INFO L225 Difference]: With dead ends: 474 [2022-11-02 21:01:56,493 INFO L226 Difference]: Without dead ends: 474 [2022-11-02 21:01:56,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 740 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=511, Invalid=1841, Unknown=0, NotChecked=0, Total=2352 [2022-11-02 21:01:56,494 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 185 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:56,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 572 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:01:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-11-02 21:01:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 454. [2022-11-02 21:01:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 452 states have (on average 1.0575221238938053) internal successors, (478), 453 states have internal predecessors, (478), 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) [2022-11-02 21:01:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 478 transitions. [2022-11-02 21:01:56,502 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 478 transitions. Word has length 380 [2022-11-02 21:01:56,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:56,503 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 478 transitions. [2022-11-02 21:01:56,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.16) internal successors, (229), 25 states have internal predecessors, (229), 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) [2022-11-02 21:01:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 478 transitions. [2022-11-02 21:01:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2022-11-02 21:01:56,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:56,510 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 35, 35, 35, 30, 30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 2, 1, 1, 1] [2022-11-02 21:01:56,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-02 21:01:56,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-02 21:01:56,725 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-11-02 21:01:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1638541870, now seen corresponding path program 10 times [2022-11-02 21:01:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:56,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412710872] [2022-11-02 21:01:56,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5842 backedges. 3434 proven. 583 refuted. 0 times theorem prover too weak. 1825 trivial. 0 not checked. [2022-11-02 21:01:57,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:57,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412710872] [2022-11-02 21:01:57,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412710872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:01:57,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607838987] [2022-11-02 21:01:57,728 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 21:01:57,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:01:57,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:01:57,729 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:01:57,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db4610c-3100-4ad8-8f78-ab492af4f984/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process