./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ --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 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- 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-dbf71c6-m [2022-10-17 10:22:14,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:22:14,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:22:14,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:22:14,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:22:14,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:22:14,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:22:14,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:22:14,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:22:14,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:22:14,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:22:14,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:22:14,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:22:14,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:22:14,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:22:14,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:22:14,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:22:14,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:22:14,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:22:14,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:22:14,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:22:14,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:22:14,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:22:14,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:22:14,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:22:14,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:22:14,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:22:14,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:22:14,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:22:14,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:22:14,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:22:14,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:22:14,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:22:14,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:22:14,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:22:14,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:22:14,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:22:14,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:22:14,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:22:14,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:22:14,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:22:14,790 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-10-17 10:22:14,828 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:22:14,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:22:14,829 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:22:14,829 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:22:14,830 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:22:14,830 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:22:14,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:22:14,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:22:14,831 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:22:14,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:22:14,832 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-17 10:22:14,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:22:14,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:22:14,833 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-17 10:22:14,833 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-17 10:22:14,834 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-17 10:22:14,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:22:14,834 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-17 10:22:14,834 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:22:14,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:22:14,835 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:22:14,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:22:14,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:22:14,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:22:14,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:22:14,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:22:14,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:22:14,842 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_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/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_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2022-10-17 10:22:15,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:22:15,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:22:15,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:22:15,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:22:15,170 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:22:15,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-10-17 10:22:15,244 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/data/0d46fac4d/46d9117c03194cc5b98190b34a42b8c7/FLAG91e83e521 [2022-10-17 10:22:15,695 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:22:15,696 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-10-17 10:22:15,702 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/data/0d46fac4d/46d9117c03194cc5b98190b34a42b8c7/FLAG91e83e521 [2022-10-17 10:22:16,085 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/data/0d46fac4d/46d9117c03194cc5b98190b34a42b8c7 [2022-10-17 10:22:16,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:22:16,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:22:16,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:22:16,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:22:16,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:22:16,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26df0641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16, skipping insertion in model container [2022-10-17 10:22:16,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:22:16,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:22:16,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:22:16,335 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:22:16,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:22:16,375 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:22:16,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16 WrapperNode [2022-10-17 10:22:16,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:22:16,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:22:16,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:22:16,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:22:16,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,426 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2022-10-17 10:22:16,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:22:16,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:22:16,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:22:16,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:22:16,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,472 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:22:16,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:22:16,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:22:16,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:22:16,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (1/1) ... [2022-10-17 10:22:16,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:22:16,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:22:16,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:22:16,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:22:16,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:22:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:22:16,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:22:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-17 10:22:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:22:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:22:16,663 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:22:16,665 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:22:16,906 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:22:16,912 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:22:16,912 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-17 10:22:16,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:22:16 BoogieIcfgContainer [2022-10-17 10:22:16,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:22:16,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:22:16,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:22:16,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:22:16,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:22:16" (1/3) ... [2022-10-17 10:22:16,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b75154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:22:16, skipping insertion in model container [2022-10-17 10:22:16,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:22:16" (2/3) ... [2022-10-17 10:22:16,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b75154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:22:16, skipping insertion in model container [2022-10-17 10:22:16,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:22:16" (3/3) ... [2022-10-17 10:22:16,924 INFO L112 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2022-10-17 10:22:16,943 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:22:16,943 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-10-17 10:22:17,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:22:17,025 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;@2e307d93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:22:17,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-10-17 10:22:17,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 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-10-17 10:22:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-17 10:22:17,064 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:17,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-17 10:22:17,066 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:17,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:17,072 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-17 10:22:17,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:17,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258626065] [2022-10-17 10:22:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:17,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:17,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:17,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258626065] [2022-10-17 10:22:17,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258626065] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:17,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:17,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:22:17,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499867798] [2022-10-17 10:22:17,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:17,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:22:17,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:17,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:22:17,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:22:17,889 INFO L87 Difference]: Start difference. First operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-10-17 10:22:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:18,029 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-10-17 10:22:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:22:18,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-10-17 10:22:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:18,043 INFO L225 Difference]: With dead ends: 52 [2022-10-17 10:22:18,044 INFO L226 Difference]: Without dead ends: 50 [2022-10-17 10:22:18,048 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-10-17 10:22:18,057 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:18,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:22:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-17 10:22:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-17 10:22:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 49 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-10-17 10:22:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-10-17 10:22:18,116 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 3 [2022-10-17 10:22:18,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:18,117 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-10-17 10:22:18,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-10-17 10:22:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-10-17 10:22:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-17 10:22:18,118 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:18,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-17 10:22:18,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:22:18,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:18,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:18,123 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-17 10:22:18,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:18,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398097714] [2022-10-17 10:22:18,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:18,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:18,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:18,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398097714] [2022-10-17 10:22:18,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398097714] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:18,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:18,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:22:18,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059513472] [2022-10-17 10:22:18,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:18,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:22:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:22:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:22:18,500 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-10-17 10:22:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:18,570 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-10-17 10:22:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:22:18,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-10-17 10:22:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:18,572 INFO L225 Difference]: With dead ends: 46 [2022-10-17 10:22:18,572 INFO L226 Difference]: Without dead ends: 46 [2022-10-17 10:22:18,573 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-10-17 10:22:18,575 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24 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.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:18,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:22:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-17 10:22:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-17 10:22:18,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 2.130434782608696) internal successors, (49), 45 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-10-17 10:22:18,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-10-17 10:22:18,583 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 3 [2022-10-17 10:22:18,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:18,583 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-10-17 10:22:18,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-10-17 10:22:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-10-17 10:22:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-17 10:22:18,585 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:18,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-17 10:22:18,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:22:18,585 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-10-17 10:22:18,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:18,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138604213] [2022-10-17 10:22:18,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:18,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:18,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:18,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138604213] [2022-10-17 10:22:18,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138604213] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:18,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:18,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:22:18,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698249909] [2022-10-17 10:22:18,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:18,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:22:18,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:18,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:22:18,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:22:18,666 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:18,721 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-10-17 10:22:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:22:18,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-17 10:22:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:18,723 INFO L225 Difference]: With dead ends: 42 [2022-10-17 10:22:18,723 INFO L226 Difference]: Without dead ends: 42 [2022-10-17 10:22:18,724 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-10-17 10:22:18,725 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:18,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:22:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-17 10:22:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-10-17 10:22:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 41 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-10-17 10:22:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-10-17 10:22:18,732 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2022-10-17 10:22:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:18,733 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-10-17 10:22:18,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-10-17 10:22:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-17 10:22:18,734 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:18,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-17 10:22:18,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:22:18,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:18,736 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-10-17 10:22:18,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:18,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993659414] [2022-10-17 10:22:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:18,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:18,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:18,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993659414] [2022-10-17 10:22:18,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993659414] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:18,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:18,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:22:18,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890964230] [2022-10-17 10:22:18,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:18,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:22:18,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:18,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:22:18,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:22:18,881 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:18,922 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-10-17 10:22:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:22:18,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-17 10:22:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:18,924 INFO L225 Difference]: With dead ends: 38 [2022-10-17 10:22:18,924 INFO L226 Difference]: Without dead ends: 38 [2022-10-17 10:22:18,925 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-10-17 10:22:18,926 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:18,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:22:18,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-17 10:22:18,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-17 10:22:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 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-10-17 10:22:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-10-17 10:22:18,936 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 4 [2022-10-17 10:22:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:18,937 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-10-17 10:22:18,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-10-17 10:22:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-17 10:22:18,940 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:18,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-17 10:22:18,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:22:18,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:18,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-10-17 10:22:18,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:18,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625391139] [2022-10-17 10:22:18,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:19,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:19,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625391139] [2022-10-17 10:22:19,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625391139] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:19,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:19,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:22:19,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053553419] [2022-10-17 10:22:19,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:19,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:22:19,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:22:19,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:22:19,084 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:19,142 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-10-17 10:22:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:22:19,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-17 10:22:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:19,145 INFO L225 Difference]: With dead ends: 34 [2022-10-17 10:22:19,145 INFO L226 Difference]: Without dead ends: 34 [2022-10-17 10:22:19,146 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-10-17 10:22:19,149 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 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-10-17 10:22:19,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:22:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-17 10:22:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-17 10:22:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.608695652173913) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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-10-17 10:22:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-10-17 10:22:19,164 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 5 [2022-10-17 10:22:19,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:19,165 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-10-17 10:22:19,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,165 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-10-17 10:22:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-17 10:22:19,166 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:19,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-17 10:22:19,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:22:19,170 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:19,175 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-10-17 10:22:19,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:19,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044292506] [2022-10-17 10:22:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:19,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:19,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:19,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044292506] [2022-10-17 10:22:19,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044292506] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:19,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:19,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:22:19,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272140533] [2022-10-17 10:22:19,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:19,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:22:19,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:19,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:22:19,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:22:19,347 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:19,391 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-10-17 10:22:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:22:19,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-17 10:22:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:19,394 INFO L225 Difference]: With dead ends: 30 [2022-10-17 10:22:19,395 INFO L226 Difference]: Without dead ends: 30 [2022-10-17 10:22:19,395 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-10-17 10:22:19,398 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:19,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:22:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-17 10:22:19,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-17 10:22:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 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-10-17 10:22:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-10-17 10:22:19,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 5 [2022-10-17 10:22:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:19,412 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-10-17 10:22:19,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-10-17 10:22:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-17 10:22:19,413 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:19,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-17 10:22:19,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:22:19,414 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:19,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2022-10-17 10:22:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:19,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763199972] [2022-10-17 10:22:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:19,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:19,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763199972] [2022-10-17 10:22:19,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763199972] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:19,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:19,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:22:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769085183] [2022-10-17 10:22:19,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:19,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:22:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:19,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:22:19,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:22:19,498 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:19,536 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-10-17 10:22:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:22:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-17 10:22:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:19,539 INFO L225 Difference]: With dead ends: 27 [2022-10-17 10:22:19,540 INFO L226 Difference]: Without dead ends: 27 [2022-10-17 10:22:19,540 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-10-17 10:22:19,543 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:19,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:22:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-17 10:22:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-10-17 10:22:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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-10-17 10:22:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-10-17 10:22:19,559 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-10-17 10:22:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:19,559 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-10-17 10:22:19,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-10-17 10:22:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-17 10:22:19,561 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:19,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-17 10:22:19,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:22:19,562 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2022-10-17 10:22:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:19,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595167505] [2022-10-17 10:22:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:19,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:19,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:19,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595167505] [2022-10-17 10:22:19,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595167505] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:19,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:19,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:22:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181898697] [2022-10-17 10:22:19,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:19,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:22:19,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:19,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:22:19,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:22:19,673 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:19,698 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-10-17 10:22:19,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:22:19,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-17 10:22:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:19,701 INFO L225 Difference]: With dead ends: 24 [2022-10-17 10:22:19,701 INFO L226 Difference]: Without dead ends: 24 [2022-10-17 10:22:19,702 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-10-17 10:22:19,702 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:19,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:22:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-10-17 10:22:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-10-17 10:22:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-10-17 10:22:19,709 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2022-10-17 10:22:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:19,710 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-10-17 10:22:19,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-10-17 10:22:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-17 10:22:19,714 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:19,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:19,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:22:19,714 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:19,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:19,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1115961648, now seen corresponding path program 1 times [2022-10-17 10:22:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:19,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748680368] [2022-10-17 10:22:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:19,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748680368] [2022-10-17 10:22:19,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748680368] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:19,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:19,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 10:22:19,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494745580] [2022-10-17 10:22:19,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:19,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 10:22:19,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:19,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 10:22:19,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 10:22:19,809 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:19,884 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-10-17 10:22:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 10:22:19,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-17 10:22:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:19,886 INFO L225 Difference]: With dead ends: 39 [2022-10-17 10:22:19,886 INFO L226 Difference]: Without dead ends: 39 [2022-10-17 10:22:19,886 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-10-17 10:22:19,889 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 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-10-17 10:22:19,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:22:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-17 10:22:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2022-10-17 10:22:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-17 10:22:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-10-17 10:22:19,897 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2022-10-17 10:22:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:19,897 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-10-17 10:22:19,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-10-17 10:22:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-17 10:22:19,898 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:19,899 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:19,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:22:19,903 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:19,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:19,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1456723757, now seen corresponding path program 1 times [2022-10-17 10:22:19,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:19,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861938065] [2022-10-17 10:22:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:19,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:20,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:20,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861938065] [2022-10-17 10:22:20,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861938065] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:22:20,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128930204] [2022-10-17 10:22:20,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:20,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:22:20,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:22:20,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:22:20,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-17 10:22:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:20,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 21 conjunts are in the unsatisfiable core [2022-10-17 10:22:20,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:22:20,597 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 18 treesize of output 16 [2022-10-17 10:22:20,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-17 10:22:20,681 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 14 treesize of output 16 [2022-10-17 10:22:20,695 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-10-17 10:22:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:20,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:22:20,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-10-17 10:22:20,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:22:20,748 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-10-17 10:22:20,752 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 30 treesize of output 22 [2022-10-17 10:22:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-17 10:22:20,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128930204] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:22:20,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:22:20,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-10-17 10:22:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753204032] [2022-10-17 10:22:20,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:22:20,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:22:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:20,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:22:20,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2022-10-17 10:22:20,779 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-10-17 10:22:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:20,893 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-10-17 10:22:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:22:20,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-17 10:22:20,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:20,895 INFO L225 Difference]: With dead ends: 41 [2022-10-17 10:22:20,895 INFO L226 Difference]: Without dead ends: 41 [2022-10-17 10:22:20,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2022-10-17 10:22:20,896 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:20,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-10-17 10:22:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-17 10:22:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-10-17 10:22:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-10-17 10:22:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-10-17 10:22:20,900 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2022-10-17 10:22:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:20,900 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-10-17 10:22:20,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-10-17 10:22:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-10-17 10:22:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-17 10:22:20,901 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:20,901 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:20,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-17 10:22:21,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:22:21,102 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:21,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:21,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1715432197, now seen corresponding path program 1 times [2022-10-17 10:22:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:21,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953120882] [2022-10-17 10:22:21,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:21,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:22,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:22,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953120882] [2022-10-17 10:22:22,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953120882] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:22,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:22,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:22:22,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411709700] [2022-10-17 10:22:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:22,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:22:22,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:22,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:22:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:22:22,070 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-10-17 10:22:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:22,577 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-10-17 10:22:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 10:22:22,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-10-17 10:22:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:22,579 INFO L225 Difference]: With dead ends: 55 [2022-10-17 10:22:22,579 INFO L226 Difference]: Without dead ends: 55 [2022-10-17 10:22:22,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-10-17 10:22:22,580 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 71 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:22,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 70 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 10:22:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-17 10:22:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2022-10-17 10:22:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 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-10-17 10:22:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-10-17 10:22:22,583 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2022-10-17 10:22:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:22,584 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-10-17 10:22:22,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-10-17 10:22:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-10-17 10:22:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-17 10:22:22,588 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:22,589 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:22,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 10:22:22,589 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2128935000, now seen corresponding path program 1 times [2022-10-17 10:22:22,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:22,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924549002] [2022-10-17 10:22:22,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-17 10:22:23,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:23,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924549002] [2022-10-17 10:22:23,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924549002] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:22:23,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077726482] [2022-10-17 10:22:23,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:23,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:22:23,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:22:23,185 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:22:23,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-17 10:22:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:23,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-17 10:22:23,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:22:23,337 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 51 treesize of output 49 [2022-10-17 10:22:23,440 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-10-17 10:22:23,576 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-17 10:22:23,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-10-17 10:22:23,637 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 14 treesize of output 16 [2022-10-17 10:22:23,675 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-10-17 10:22:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:23,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:22:23,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-10-17 10:22:23,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) is different from false [2022-10-17 10:22:23,834 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 67 treesize of output 59 [2022-10-17 10:22:23,842 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 24 treesize of output 22 [2022-10-17 10:22:23,846 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 38 treesize of output 34 [2022-10-17 10:22:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-17 10:22:23,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077726482] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:22:23,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:22:23,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-10-17 10:22:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17269973] [2022-10-17 10:22:23,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:22:23,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-17 10:22:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:23,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-17 10:22:23,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=303, Unknown=2, NotChecked=74, Total=462 [2022-10-17 10:22:23,936 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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-10-17 10:22:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:24,474 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-10-17 10:22:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-17 10:22:24,477 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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-10-17 10:22:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:24,478 INFO L225 Difference]: With dead ends: 59 [2022-10-17 10:22:24,479 INFO L226 Difference]: Without dead ends: 59 [2022-10-17 10:22:24,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=683, Unknown=2, NotChecked=118, Total=1056 [2022-10-17 10:22:24,482 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 157 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:24,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 107 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 152 Invalid, 0 Unknown, 128 Unchecked, 0.2s Time] [2022-10-17 10:22:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-17 10:22:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-10-17 10:22:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 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-10-17 10:22:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-10-17 10:22:24,497 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 23 [2022-10-17 10:22:24,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:24,497 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-10-17 10:22:24,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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-10-17 10:22:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-10-17 10:22:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-17 10:22:24,499 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:24,500 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:24,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-17 10:22:24,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-10-17 10:22:24,713 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:24,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:24,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1038287010, now seen corresponding path program 1 times [2022-10-17 10:22:24,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:24,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525737552] [2022-10-17 10:22:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:24,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-17 10:22:25,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:25,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525737552] [2022-10-17 10:22:25,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525737552] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:22:25,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105158136] [2022-10-17 10:22:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:25,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:22:25,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:22:25,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:22:25,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-17 10:22:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:25,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 39 conjunts are in the unsatisfiable core [2022-10-17 10:22:25,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:22:25,734 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 414 treesize of output 406 [2022-10-17 10:22:25,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-17 10:22:25,937 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-17 10:22:25,938 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 1 case distinctions, treesize of input 19 treesize of output 22 [2022-10-17 10:22:26,130 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-17 10:22:26,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-10-17 10:22:26,200 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-17 10:22:26,201 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-10-17 10:22:26,267 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 14 treesize of output 16 [2022-10-17 10:22:26,297 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-10-17 10:22:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:26,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:22:26,312 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-10-17 10:22:26,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-10-17 10:22:26,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-10-17 10:22:26,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:22:26,598 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2022-10-17 10:22:26,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:22:26,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 390 treesize of output 382 [2022-10-17 10:22:26,634 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 368 treesize of output 344 [2022-10-17 10:22:26,658 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 356 treesize of output 346 [2022-10-17 10:22:26,801 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 246 treesize of output 238 [2022-10-17 10:22:27,423 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 115 treesize of output 111 [2022-10-17 10:22:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-17 10:22:27,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105158136] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:22:27,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:22:27,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2022-10-17 10:22:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020473378] [2022-10-17 10:22:27,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:22:27,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-17 10:22:27,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:27,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-17 10:22:27,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=534, Unknown=3, NotChecked=150, Total=812 [2022-10-17 10:22:27,487 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:27,732 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-10-17 10:22:29,274 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-10-17 10:22:30,734 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) (and (or (and (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (= |c_ULTIMATE.start_main_#t~mem6#1| 0)) (not .cse0)) (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) .cse1 (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2022-10-17 10:22:32,360 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-10-17 10:22:32,795 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)))) (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) .cse0 (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-10-17 10:22:32,812 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and (or (and (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|) (= |c_ULTIMATE.start_main_#t~mem5#1| 0)) (not .cse0)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (or .cse0 (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-10-17 10:22:32,839 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-10-17 10:22:34,846 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-10-17 10:22:36,855 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (and (or (and (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (= |c_ULTIMATE.start_main_#t~mem6#1| 0)) (not .cse0)) (or .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2022-10-17 10:22:38,874 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-10-17 10:22:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:38,931 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2022-10-17 10:22:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-17 10:22:38,932 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-17 10:22:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:22:38,934 INFO L225 Difference]: With dead ends: 137 [2022-10-17 10:22:38,935 INFO L226 Difference]: Without dead ends: 137 [2022-10-17 10:22:38,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=273, Invalid=1026, Unknown=13, NotChecked=1040, Total=2352 [2022-10-17 10:22:38,937 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 105 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 10:22:38,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 244 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 311 Invalid, 0 Unknown, 358 Unchecked, 0.3s Time] [2022-10-17 10:22:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-10-17 10:22:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 77. [2022-10-17 10:22:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-10-17 10:22:38,942 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 26 [2022-10-17 10:22:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:22:38,942 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-10-17 10:22:38,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:22:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-10-17 10:22:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-17 10:22:38,944 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:22:38,944 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:38,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-17 10:22:39,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-17 10:22:39,145 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-10-17 10:22:39,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1790452235, now seen corresponding path program 1 times [2022-10-17 10:22:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:39,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972870156] [2022-10-17 10:22:39,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:39,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:39,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:39,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972870156] [2022-10-17 10:22:39,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972870156] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:22:39,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884119930] [2022-10-17 10:22:39,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:39,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:22:39,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:22:39,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:22:39,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3528342-6c4f-4b09-9f13-7518dc2b7c27/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-17 10:22:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:39,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-17 10:22:39,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:22:39,984 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-10-17 10:22:40,031 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-17 10:22:40,031 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 14 treesize of output 20 [2022-10-17 10:22:40,040 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 5 treesize of output 3 [2022-10-17 10:22:40,160 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-17 10:22:40,161 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 18 treesize of output 24 [2022-10-17 10:22:40,171 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 5 treesize of output 3 [2022-10-17 10:22:40,441 INFO L356 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-10-17 10:22:40,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2022-10-17 10:22:40,591 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-17 10:22:40,592 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 19 treesize of output 18 [2022-10-17 10:22:40,634 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-10-17 10:22:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:40,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:22:42,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) is different from false [2022-10-17 10:22:43,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) is different from false [2022-10-17 10:22:45,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2022-10-17 10:22:45,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_480))) (or (= (select (select (let ((.cse0 (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-10-17 10:22:45,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:22:45,630 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 56 [2022-10-17 10:22:45,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:22:45,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1032 treesize of output 1016 [2022-10-17 10:22:45,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:22:45,682 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 1182 treesize of output 1144 [2022-10-17 10:22:45,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-17 10:22:45,799 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 1074 treesize of output 1034 [2022-10-17 10:22:46,245 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 148 treesize of output 140 [2022-10-17 10:22:46,362 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 663 treesize of output 651 [2022-10-17 10:22:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-10-17 10:22:46,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884119930] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:22:46,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:22:46,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2022-10-17 10:22:46,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158861090] [2022-10-17 10:22:46,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:22:46,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-17 10:22:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:46,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-17 10:22:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=307, Unknown=4, NotChecked=156, Total=552 [2022-10-17 10:22:46,889 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 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-10-17 10:22:46,955 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_480))) (or (= (select (select (let ((.cse0 (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) is different from false [2022-10-17 10:22:46,961 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) (.cse2 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and .cse0 (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int))) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (or .cse0 .cse2) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not .cse2))) is different from false [2022-10-17 10:22:48,179 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (let ((.cse2 (or (= (select .cse7 |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) .cse3)) (.cse4 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse0 (= (select .cse6 |c_ULTIMATE.start_main_~x0~0#1.offset|) 0)) (.cse1 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|))) (and (or (and (or (and (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) .cse0) (not .cse1)) (or .cse1 (and .cse2 (or (and .cse0 (= |c_ULTIMATE.start_main_#t~malloc2#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (not .cse3))))) .cse4) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse5 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse5 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) .cse2 (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or (not .cse4) (and (= |c_ULTIMATE.start_main_#t~malloc2#1.base| |c_ULTIMATE.start_main_#t~malloc1#1.base|) .cse0)) (or (= (select .cse7 0) 0) (and .cse1 (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0))))))) is different from false [2022-10-17 10:22:49,212 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (let ((.cse3 (or (= (select .cse6 |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) .cse5)) (.cse1 (= |c_ULTIMATE.start_main_#t~mem5#1| 0)) (.cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|))) (and (or (not .cse0) (and (= |c_ULTIMATE.start_main_#t~malloc2#1.base| |c_ULTIMATE.start_main_#t~malloc1#1.base|) .cse1)) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse2 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse2 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) .cse3 (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (or (and (or .cse4 (and (or (and .cse1 (= |c_ULTIMATE.start_main_#t~malloc2#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (not .cse5)) .cse3)) (or (and (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) .cse1) (not .cse4))) .cse0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or (= (select .cse6 0) 0) (and .cse4 (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0))))))) is different from false [2022-10-17 10:22:51,217 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not .cse2) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (or (= (select .cse0 0) 0) (and .cse2 (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0)))))) is different from false