./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0513.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0513.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e --- 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-e04fb08 [2022-11-16 12:21:37,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:21:37,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:21:37,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:21:37,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:21:37,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:21:37,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:21:37,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:21:37,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:21:37,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:21:37,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:21:37,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:21:37,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:21:37,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:21:37,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:21:37,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:21:37,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:21:37,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:21:37,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:21:37,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:21:37,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:21:37,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:21:37,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:21:37,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:21:37,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:21:37,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:21:37,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:21:37,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:21:37,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:21:37,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:21:37,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:21:37,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:21:37,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:21:37,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:21:37,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:21:37,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:21:37,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:21:37,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:21:37,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:21:37,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:21:37,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:21:37,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:21:37,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:21:37,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:21:37,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:21:37,500 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:21:37,501 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:21:37,501 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:21:37,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:21:37,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:21:37,503 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:21:37,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:21:37,505 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:21:37,505 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:21:37,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:21:37,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:21:37,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:21:37,506 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:21:37,507 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:21:37,507 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:21:37,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:21:37,508 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:21:37,508 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:21:37,508 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:21:37,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:21:37,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:21:37,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:21:37,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:21:37,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:21:37,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:21:37,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:21:37,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:21:37,511 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_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/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_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2022-11-16 12:21:37,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:21:37,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:21:37,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:21:37,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:21:37,919 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:21:37,921 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/memsafety/test-0513.i [2022-11-16 12:21:38,024 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/data/257db383c/5c5ac13516364c3d9ccdb2b1d8f397ef/FLAG1120486dd [2022-11-16 12:21:38,664 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:21:38,665 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/sv-benchmarks/c/memsafety/test-0513.i [2022-11-16 12:21:38,690 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/data/257db383c/5c5ac13516364c3d9ccdb2b1d8f397ef/FLAG1120486dd [2022-11-16 12:21:38,895 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/data/257db383c/5c5ac13516364c3d9ccdb2b1d8f397ef [2022-11-16 12:21:38,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:21:38,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:21:38,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:21:38,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:21:38,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:21:38,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:38" (1/1) ... [2022-11-16 12:21:38,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cdc32ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:38, skipping insertion in model container [2022-11-16 12:21:38,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:38" (1/1) ... [2022-11-16 12:21:38,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:21:38,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:21:39,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:21:39,507 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:21:39,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:21:39,618 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:21:39,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39 WrapperNode [2022-11-16 12:21:39,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:21:39,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:21:39,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:21:39,620 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:21:39,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,714 INFO L138 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2022-11-16 12:21:39,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:21:39,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:21:39,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:21:39,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:21:39,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,745 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:21:39,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:21:39,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:21:39,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:21:39,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (1/1) ... [2022-11-16 12:21:39,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:21:39,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:39,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:21:39,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:21:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:21:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:21:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:21:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:21:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:21:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:21:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:21:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:21:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:21:39,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:21:40,018 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:21:40,021 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:21:40,540 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:21:40,548 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:21:40,548 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 12:21:40,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:40 BoogieIcfgContainer [2022-11-16 12:21:40,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:21:40,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:21:40,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:21:40,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:21:40,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:21:38" (1/3) ... [2022-11-16 12:21:40,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530ec39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:40, skipping insertion in model container [2022-11-16 12:21:40,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:39" (2/3) ... [2022-11-16 12:21:40,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530ec39f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:40, skipping insertion in model container [2022-11-16 12:21:40,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:40" (3/3) ... [2022-11-16 12:21:40,562 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513.i [2022-11-16 12:21:40,590 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:21:40,590 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-16 12:21:40,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:21:40,683 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;@20d813d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:21:40,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-11-16 12:21:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 12:21:40,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:40,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 12:21:40,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:40,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash 28740643, now seen corresponding path program 1 times [2022-11-16 12:21:40,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:40,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648734585] [2022-11-16 12:21:40,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:40,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:40,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:40,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648734585] [2022-11-16 12:21:40,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648734585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:40,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:40,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:40,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649441056] [2022-11-16 12:21:40,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:40,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:21:40,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:40,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:21:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:21:40,983 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:41,027 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2022-11-16 12:21:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:21:41,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 12:21:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:41,046 INFO L225 Difference]: With dead ends: 132 [2022-11-16 12:21:41,047 INFO L226 Difference]: Without dead ends: 130 [2022-11-16 12:21:41,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:21:41,058 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:41,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:21:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-16 12:21:41,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-16 12:21:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2022-11-16 12:21:41,116 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 5 [2022-11-16 12:21:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:41,117 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2022-11-16 12:21:41,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2022-11-16 12:21:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:21:41,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:41,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:21:41,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:21:41,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:41,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash 889570808, now seen corresponding path program 1 times [2022-11-16 12:21:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:41,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351256604] [2022-11-16 12:21:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:41,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:41,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:41,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351256604] [2022-11-16 12:21:41,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351256604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:41,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:41,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175186712] [2022-11-16 12:21:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:41,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:41,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:41,201 INFO L87 Difference]: Start difference. First operand 130 states and 138 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-11-16 12:21:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:41,419 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2022-11-16 12:21:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:41,420 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-11-16 12:21:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:41,422 INFO L225 Difference]: With dead ends: 176 [2022-11-16 12:21:41,422 INFO L226 Difference]: Without dead ends: 175 [2022-11-16 12:21:41,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:41,424 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:41,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:21:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-16 12:21:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2022-11-16 12:21:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2022-11-16 12:21:41,436 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2022-11-16 12:21:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:41,436 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2022-11-16 12:21:41,437 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-11-16 12:21:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2022-11-16 12:21:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:21:41,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:41,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:21:41,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:21:41,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:41,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:41,439 INFO L85 PathProgramCache]: Analyzing trace with hash 889570732, now seen corresponding path program 1 times [2022-11-16 12:21:41,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:41,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992141468] [2022-11-16 12:21:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:41,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:41,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:41,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992141468] [2022-11-16 12:21:41,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992141468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:41,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:41,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:21:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301433454] [2022-11-16 12:21:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:41,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:41,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:41,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:41,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:41,560 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 3 states, 3 states have (on average 2.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-11-16 12:21:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:41,689 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2022-11-16 12:21:41,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:41,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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-11-16 12:21:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:41,696 INFO L225 Difference]: With dead ends: 145 [2022-11-16 12:21:41,697 INFO L226 Difference]: Without dead ends: 144 [2022-11-16 12:21:41,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:41,704 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:41,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 229 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:21:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-16 12:21:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2022-11-16 12:21:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2022-11-16 12:21:41,714 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2022-11-16 12:21:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:41,714 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2022-11-16 12:21:41,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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-11-16 12:21:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2022-11-16 12:21:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:21:41,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:41,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:21:41,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:21:41,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:41,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:41,724 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2022-11-16 12:21:41,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:41,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455938464] [2022-11-16 12:21:41,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:41,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:41,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455938464] [2022-11-16 12:21:41,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455938464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:41,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:41,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406330896] [2022-11-16 12:21:41,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:41,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:41,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:41,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:41,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:41,815 INFO L87 Difference]: Start difference. First operand 138 states and 150 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-11-16 12:21:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:41,964 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2022-11-16 12:21:41,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:41,965 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-11-16 12:21:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:41,968 INFO L225 Difference]: With dead ends: 169 [2022-11-16 12:21:41,968 INFO L226 Difference]: Without dead ends: 169 [2022-11-16 12:21:41,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:41,979 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 75 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:41,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 167 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:21:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-16 12:21:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2022-11-16 12:21:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2022-11-16 12:21:41,989 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 6 [2022-11-16 12:21:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:41,989 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2022-11-16 12:21:41,989 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-11-16 12:21:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2022-11-16 12:21:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:21:41,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:41,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:21:41,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:21:41,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2022-11-16 12:21:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:42,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688124402] [2022-11-16 12:21:42,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:42,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:42,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688124402] [2022-11-16 12:21:42,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688124402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:42,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:42,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:42,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887273879] [2022-11-16 12:21:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:42,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:42,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:42,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:42,108 INFO L87 Difference]: Start difference. First operand 139 states and 153 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-11-16 12:21:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:42,243 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2022-11-16 12:21:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:42,244 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-11-16 12:21:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:42,245 INFO L225 Difference]: With dead ends: 137 [2022-11-16 12:21:42,245 INFO L226 Difference]: Without dead ends: 137 [2022-11-16 12:21:42,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:42,246 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:42,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 173 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:21:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-16 12:21:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-11-16 12:21:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2022-11-16 12:21:42,253 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2022-11-16 12:21:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:42,254 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2022-11-16 12:21:42,254 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-11-16 12:21:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2022-11-16 12:21:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:21:42,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:42,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:42,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:21:42,255 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:42,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659887, now seen corresponding path program 1 times [2022-11-16 12:21:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:42,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740984051] [2022-11-16 12:21:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:42,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740984051] [2022-11-16 12:21:42,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740984051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:42,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:42,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602433411] [2022-11-16 12:21:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:42,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:42,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:42,325 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:42,421 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-11-16 12:21:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:42,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 12:21:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:42,423 INFO L225 Difference]: With dead ends: 133 [2022-11-16 12:21:42,423 INFO L226 Difference]: Without dead ends: 133 [2022-11-16 12:21:42,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:42,424 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:42,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 168 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:21:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-16 12:21:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-11-16 12:21:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-11-16 12:21:42,430 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2022-11-16 12:21:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:42,431 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-11-16 12:21:42,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-11-16 12:21:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:21:42,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:42,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:42,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:21:42,432 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:42,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659886, now seen corresponding path program 1 times [2022-11-16 12:21:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:42,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343735898] [2022-11-16 12:21:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:42,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:42,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343735898] [2022-11-16 12:21:42,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343735898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:42,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:42,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:21:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701461966] [2022-11-16 12:21:42,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:42,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:21:42,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:42,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:21:42,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:42,534 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:42,650 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-11-16 12:21:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:21:42,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 12:21:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:42,652 INFO L225 Difference]: With dead ends: 130 [2022-11-16 12:21:42,652 INFO L226 Difference]: Without dead ends: 130 [2022-11-16 12:21:42,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:21:42,653 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:42,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 179 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:21:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-16 12:21:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-16 12:21:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-11-16 12:21:42,659 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2022-11-16 12:21:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:42,660 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-11-16 12:21:42,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-11-16 12:21:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:21:42,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:42,661 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:42,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:21:42,662 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:42,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:42,662 INFO L85 PathProgramCache]: Analyzing trace with hash -967503371, now seen corresponding path program 1 times [2022-11-16 12:21:42,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:42,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113830883] [2022-11-16 12:21:42,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:42,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:42,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:42,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113830883] [2022-11-16 12:21:42,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113830883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:42,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:42,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:21:42,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290558738] [2022-11-16 12:21:42,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:42,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:21:42,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:42,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:21:42,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:21:42,763 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:42,930 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2022-11-16 12:21:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:21:42,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 12:21:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:42,932 INFO L225 Difference]: With dead ends: 228 [2022-11-16 12:21:42,932 INFO L226 Difference]: Without dead ends: 228 [2022-11-16 12:21:42,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:21:42,933 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 126 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:42,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 251 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:21:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-16 12:21:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 130. [2022-11-16 12:21:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2022-11-16 12:21:42,958 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2022-11-16 12:21:42,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:42,959 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2022-11-16 12:21:42,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2022-11-16 12:21:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:21:42,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:42,964 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:42,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:21:42,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash -967503447, now seen corresponding path program 1 times [2022-11-16 12:21:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:42,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093863229] [2022-11-16 12:21:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:42,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:43,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:43,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093863229] [2022-11-16 12:21:43,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093863229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:43,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:43,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:21:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971532163] [2022-11-16 12:21:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:43,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:21:43,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:43,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:21:43,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:21:43,177 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:43,415 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-11-16 12:21:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:21:43,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 12:21:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:43,417 INFO L225 Difference]: With dead ends: 124 [2022-11-16 12:21:43,418 INFO L226 Difference]: Without dead ends: 124 [2022-11-16 12:21:43,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:21:43,421 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 46 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:43,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 213 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:21:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-16 12:21:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-11-16 12:21:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2022-11-16 12:21:43,428 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2022-11-16 12:21:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:43,440 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2022-11-16 12:21:43,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-11-16 12:21:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:21:43,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:43,443 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:43,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:21:43,443 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:43,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash -967503446, now seen corresponding path program 1 times [2022-11-16 12:21:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:43,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595661694] [2022-11-16 12:21:43,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:43,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:43,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595661694] [2022-11-16 12:21:43,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595661694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:43,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:43,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:21:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273529851] [2022-11-16 12:21:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:43,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:21:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:21:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:21:43,666 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:43,918 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2022-11-16 12:21:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:21:43,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 12:21:43,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:43,920 INFO L225 Difference]: With dead ends: 204 [2022-11-16 12:21:43,920 INFO L226 Difference]: Without dead ends: 204 [2022-11-16 12:21:43,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:21:43,921 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:43,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 168 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:21:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-16 12:21:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2022-11-16 12:21:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2022-11-16 12:21:43,926 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 18 [2022-11-16 12:21:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:43,928 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2022-11-16 12:21:43,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2022-11-16 12:21:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 12:21:43,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:43,930 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:43,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:21:43,930 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:43,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash 199814016, now seen corresponding path program 1 times [2022-11-16 12:21:43,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:43,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359014165] [2022-11-16 12:21:43,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:44,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359014165] [2022-11-16 12:21:44,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359014165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:44,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:44,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:21:44,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725402463] [2022-11-16 12:21:44,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:44,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:21:44,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:44,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:21:44,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:21:44,066 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:44,264 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2022-11-16 12:21:44,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:21:44,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-16 12:21:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:44,266 INFO L225 Difference]: With dead ends: 205 [2022-11-16 12:21:44,266 INFO L226 Difference]: Without dead ends: 205 [2022-11-16 12:21:44,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:21:44,267 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 225 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:44,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 309 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:21:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-16 12:21:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2022-11-16 12:21:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2022-11-16 12:21:44,277 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 23 [2022-11-16 12:21:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:44,277 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2022-11-16 12:21:44,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2022-11-16 12:21:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 12:21:44,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:44,281 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:44,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:21:44,282 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:44,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:44,283 INFO L85 PathProgramCache]: Analyzing trace with hash 198674982, now seen corresponding path program 1 times [2022-11-16 12:21:44,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:44,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744385934] [2022-11-16 12:21:44,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:44,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:44,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:44,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744385934] [2022-11-16 12:21:44,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744385934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:44,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:44,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:21:44,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101460269] [2022-11-16 12:21:44,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:44,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:21:44,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:44,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:21:44,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:21:44,638 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:44,857 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2022-11-16 12:21:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:21:44,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-16 12:21:44,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:44,859 INFO L225 Difference]: With dead ends: 191 [2022-11-16 12:21:44,859 INFO L226 Difference]: Without dead ends: 191 [2022-11-16 12:21:44,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:21:44,860 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 24 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:44,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 399 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:21:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-16 12:21:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2022-11-16 12:21:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2022-11-16 12:21:44,865 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 23 [2022-11-16 12:21:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:44,866 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2022-11-16 12:21:44,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2022-11-16 12:21:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 12:21:44,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:44,868 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:44,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:21:44,868 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash -165115758, now seen corresponding path program 1 times [2022-11-16 12:21:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:44,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54021267] [2022-11-16 12:21:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:45,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54021267] [2022-11-16 12:21:45,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54021267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:45,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:45,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:21:45,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094043138] [2022-11-16 12:21:45,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:45,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:21:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:45,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:21:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:21:45,362 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:46,190 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2022-11-16 12:21:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:21:46,190 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 12:21:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:46,192 INFO L225 Difference]: With dead ends: 228 [2022-11-16 12:21:46,192 INFO L226 Difference]: Without dead ends: 228 [2022-11-16 12:21:46,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:21:46,193 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 129 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:46,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 491 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:21:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-16 12:21:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 177. [2022-11-16 12:21:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-11-16 12:21:46,201 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 26 [2022-11-16 12:21:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:46,201 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-11-16 12:21:46,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-11-16 12:21:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 12:21:46,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:46,207 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:46,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:21:46,208 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:46,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:46,209 INFO L85 PathProgramCache]: Analyzing trace with hash -165115757, now seen corresponding path program 1 times [2022-11-16 12:21:46,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:46,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009294728] [2022-11-16 12:21:46,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:46,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:47,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:47,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009294728] [2022-11-16 12:21:47,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009294728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:47,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:47,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:21:47,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465209468] [2022-11-16 12:21:47,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:47,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:21:47,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:47,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:21:47,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:21:47,163 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:47,816 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2022-11-16 12:21:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:21:47,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-16 12:21:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:47,818 INFO L225 Difference]: With dead ends: 207 [2022-11-16 12:21:47,818 INFO L226 Difference]: Without dead ends: 207 [2022-11-16 12:21:47,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:21:47,820 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 80 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:47,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 353 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:21:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-16 12:21:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 177. [2022-11-16 12:21:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 222 transitions. [2022-11-16 12:21:47,826 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 222 transitions. Word has length 26 [2022-11-16 12:21:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:47,827 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 222 transitions. [2022-11-16 12:21:47,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 222 transitions. [2022-11-16 12:21:47,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 12:21:47,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:47,828 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:47,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:21:47,829 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash -823622550, now seen corresponding path program 1 times [2022-11-16 12:21:47,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:47,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893389177] [2022-11-16 12:21:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:47,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:48,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:48,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893389177] [2022-11-16 12:21:48,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893389177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:48,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:48,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:21:48,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280870812] [2022-11-16 12:21:48,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:48,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:21:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:48,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:21:48,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:21:48,215 INFO L87 Difference]: Start difference. First operand 177 states and 222 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-11-16 12:21:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:48,483 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2022-11-16 12:21:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:21:48,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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) Word has length 27 [2022-11-16 12:21:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:48,485 INFO L225 Difference]: With dead ends: 194 [2022-11-16 12:21:48,485 INFO L226 Difference]: Without dead ends: 194 [2022-11-16 12:21:48,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:21:48,486 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 45 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:48,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 406 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:21:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-16 12:21:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2022-11-16 12:21:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 221 transitions. [2022-11-16 12:21:48,497 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 221 transitions. Word has length 27 [2022-11-16 12:21:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:48,497 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 221 transitions. [2022-11-16 12:21:48,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-11-16 12:21:48,498 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 221 transitions. [2022-11-16 12:21:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 12:21:48,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:48,502 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:48,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:21:48,502 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash 237551634, now seen corresponding path program 1 times [2022-11-16 12:21:48,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:48,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081873501] [2022-11-16 12:21:48,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:48,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:48,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:48,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081873501] [2022-11-16 12:21:48,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081873501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:48,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:48,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:21:48,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252263436] [2022-11-16 12:21:48,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:48,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:21:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:21:48,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:21:48,875 INFO L87 Difference]: Start difference. First operand 177 states and 221 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:49,315 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2022-11-16 12:21:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:21:49,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-16 12:21:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:49,317 INFO L225 Difference]: With dead ends: 229 [2022-11-16 12:21:49,317 INFO L226 Difference]: Without dead ends: 229 [2022-11-16 12:21:49,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:21:49,318 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 178 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:49,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 569 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:21:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-16 12:21:49,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 179. [2022-11-16 12:21:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2022-11-16 12:21:49,326 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 28 [2022-11-16 12:21:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:49,327 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2022-11-16 12:21:49,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2022-11-16 12:21:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 12:21:49,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:49,329 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:49,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:21:49,330 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1225833714, now seen corresponding path program 1 times [2022-11-16 12:21:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:49,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287617880] [2022-11-16 12:21:49,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:49,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287617880] [2022-11-16 12:21:49,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287617880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:49,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:49,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:21:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99279943] [2022-11-16 12:21:49,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:49,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:21:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:49,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:21:49,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:21:49,725 INFO L87 Difference]: Start difference. First operand 179 states and 223 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 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-11-16 12:21:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:50,190 INFO L93 Difference]: Finished difference Result 200 states and 244 transitions. [2022-11-16 12:21:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:21:50,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 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) Word has length 29 [2022-11-16 12:21:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:50,192 INFO L225 Difference]: With dead ends: 200 [2022-11-16 12:21:50,192 INFO L226 Difference]: Without dead ends: 200 [2022-11-16 12:21:50,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:21:50,193 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 57 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:50,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 481 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:21:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-16 12:21:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2022-11-16 12:21:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2022-11-16 12:21:50,198 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 29 [2022-11-16 12:21:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:50,198 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2022-11-16 12:21:50,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 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-11-16 12:21:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2022-11-16 12:21:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 12:21:50,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:50,200 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:50,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:21:50,201 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:50,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:50,201 INFO L85 PathProgramCache]: Analyzing trace with hash 653860756, now seen corresponding path program 1 times [2022-11-16 12:21:50,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:50,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388143385] [2022-11-16 12:21:50,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:50,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:21:50,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:50,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388143385] [2022-11-16 12:21:50,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388143385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:50,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:50,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:21:50,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896838389] [2022-11-16 12:21:50,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:50,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:21:50,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:21:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:21:50,265 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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-11-16 12:21:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:50,528 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2022-11-16 12:21:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:21:50,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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) Word has length 30 [2022-11-16 12:21:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:50,530 INFO L225 Difference]: With dead ends: 251 [2022-11-16 12:21:50,530 INFO L226 Difference]: Without dead ends: 251 [2022-11-16 12:21:50,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:21:50,531 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:50,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 230 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:21:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-16 12:21:50,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 184. [2022-11-16 12:21:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2022-11-16 12:21:50,537 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 30 [2022-11-16 12:21:50,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:50,538 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2022-11-16 12:21:50,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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-11-16 12:21:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2022-11-16 12:21:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 12:21:50,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:50,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:50,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:21:50,540 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:50,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1294968215, now seen corresponding path program 1 times [2022-11-16 12:21:50,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:50,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702938191] [2022-11-16 12:21:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:50,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:51,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:51,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702938191] [2022-11-16 12:21:51,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702938191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:51,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489368903] [2022-11-16 12:21:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:51,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:51,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:51,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:21:51,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:21:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:51,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 12:21:51,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:21:51,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:21:51,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:21:51,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 12:21:51,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 12:21:52,038 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:21:52,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 12:21:52,074 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:21:52,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 12:21:52,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:21:52,267 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 12:21:52,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 36 [2022-11-16 12:21:52,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:21:53,271 INFO L321 Elim1Store]: treesize reduction 85, result has 44.4 percent of original size [2022-11-16 12:21:53,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 118 [2022-11-16 12:21:53,305 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:21:53,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2022-11-16 12:21:53,356 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-11-16 12:21:53,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 60 [2022-11-16 12:21:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:53,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:53,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 12:21:55,106 INFO L321 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2022-11-16 12:21:55,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 64 [2022-11-16 12:21:55,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-11-16 12:21:55,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse5 (not .cse0)) (.cse1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (and (or .cse0 (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse2)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse4 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse3 .cse4) 0) 0) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse4)))))) (or .cse5 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_19) (= (select (select .cse6 v_arrayElimCell_19) 0) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse7 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (or .cse0 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse8 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse8) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse8))))) (or .cse5 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse9 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse9 v_arrayElimCell_19) 0) 0)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0)))))) .cse5) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse11 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse10 .cse11) 0) 0) (= (select (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse11)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (or .cse5 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse12 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse12 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse0 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0)))) (or .cse5 (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (or .cse0 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse13 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0)))))))) is different from false [2022-11-16 12:21:56,231 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse1 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse2 v_arrayElimCell_19) 0) 0)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse3 v_arrayElimCell_20) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_19) (= (select (select .cse4 v_arrayElimCell_19) 0) 0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) is different from false [2022-11-16 12:21:56,431 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse0 .cse1 v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse3 .cse1 v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= 0 (select (select .cse2 v_arrayElimCell_20) 0))))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse3 .cse1 v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse0 .cse1 v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse3 .cse1 v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= 0 (select (select .cse4 v_arrayElimCell_20) 0))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse3 .cse1 v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse0 .cse1 v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse5 v_arrayElimCell_19) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_19)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_19 Int)) (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse0 .cse1 v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (= (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (not (= (select v_arrayElimArr_1 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse6 v_arrayElimCell_19) 0) 0)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_1 4))) (or (not (= .cse7 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse0 .cse1 v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse7) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) is different from false [2022-11-16 12:21:56,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:21:56,716 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 45 [2022-11-16 12:21:56,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:56,752 INFO L321 Elim1Store]: treesize reduction 18, result has 43.8 percent of original size [2022-11-16 12:21:56,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 38 [2022-11-16 12:21:56,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:56,773 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-16 12:21:56,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2022-11-16 12:21:56,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:56,784 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-16 12:21:56,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2022-11-16 12:21:56,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:56,805 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-16 12:21:56,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 1 [2022-11-16 12:21:56,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:56,814 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-16 12:21:56,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2022-11-16 12:21:56,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:56,829 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-16 12:21:56,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2022-11-16 12:21:56,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:56,841 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-16 12:21:56,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 1 [2022-11-16 12:21:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:56,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489368903] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:21:56,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:21:56,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 41 [2022-11-16 12:21:56,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197326599] [2022-11-16 12:21:56,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:56,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-16 12:21:56,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:56,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-16 12:21:56,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1256, Unknown=5, NotChecked=222, Total=1640 [2022-11-16 12:21:56,853 INFO L87 Difference]: Start difference. First operand 184 states and 235 transitions. Second operand has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:59,771 INFO L93 Difference]: Finished difference Result 210 states and 262 transitions. [2022-11-16 12:21:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:21:59,772 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 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 32 [2022-11-16 12:21:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:59,773 INFO L225 Difference]: With dead ends: 210 [2022-11-16 12:21:59,773 INFO L226 Difference]: Without dead ends: 210 [2022-11-16 12:21:59,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=328, Invalid=2229, Unknown=5, NotChecked=300, Total=2862 [2022-11-16 12:21:59,776 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 275 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 854 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:59,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1468 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 942 Invalid, 0 Unknown, 854 Unchecked, 1.0s Time] [2022-11-16 12:21:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-16 12:21:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 186. [2022-11-16 12:21:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 237 transitions. [2022-11-16 12:21:59,783 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 237 transitions. Word has length 32 [2022-11-16 12:21:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:59,784 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 237 transitions. [2022-11-16 12:21:59,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 237 transitions. [2022-11-16 12:21:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 12:21:59,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:59,785 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:59,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:21:59,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:59,992 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:21:59,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:59,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1489307653, now seen corresponding path program 1 times [2022-11-16 12:21:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:59,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144318391] [2022-11-16 12:21:59,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:59,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:00,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:00,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144318391] [2022-11-16 12:22:00,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144318391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:00,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588603034] [2022-11-16 12:22:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:00,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:00,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:00,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:00,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:22:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:00,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-16 12:22:00,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:00,859 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:22:00,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 32 [2022-11-16 12:22:00,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:22:01,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:01,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2022-11-16 12:22:01,336 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:22:01,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2022-11-16 12:22:01,584 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:22:01,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 39 [2022-11-16 12:22:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:01,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:02,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2022-11-16 12:22:12,536 WARN L233 SmtUtils]: Spent 10.11s on a formula simplification. DAG size of input: 48 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:22:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:15,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588603034] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:15,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:15,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32 [2022-11-16 12:22:15,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276690900] [2022-11-16 12:22:15,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:15,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 12:22:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:15,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 12:22:15,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 12:22:15,123 INFO L87 Difference]: Start difference. First operand 186 states and 237 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:16,065 INFO L93 Difference]: Finished difference Result 188 states and 238 transitions. [2022-11-16 12:22:16,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:22:16,067 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-16 12:22:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:16,068 INFO L225 Difference]: With dead ends: 188 [2022-11-16 12:22:16,069 INFO L226 Difference]: Without dead ends: 171 [2022-11-16 12:22:16,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2022-11-16 12:22:16,070 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 37 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:16,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 641 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 506 Invalid, 0 Unknown, 288 Unchecked, 0.6s Time] [2022-11-16 12:22:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-16 12:22:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-11-16 12:22:16,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 170 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 221 transitions. [2022-11-16 12:22:16,078 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 221 transitions. Word has length 33 [2022-11-16 12:22:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:16,079 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 221 transitions. [2022-11-16 12:22:16,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 221 transitions. [2022-11-16 12:22:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:22:16,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:16,080 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:16,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:16,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:16,289 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:22:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679628, now seen corresponding path program 1 times [2022-11-16 12:22:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:16,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965129812] [2022-11-16 12:22:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:16,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:16,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:16,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965129812] [2022-11-16 12:22:16,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965129812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:16,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504560289] [2022-11-16 12:22:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:16,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:16,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:16,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:16,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:22:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:17,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 12:22:17,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:17,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:22:17,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:22:17,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:17,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2022-11-16 12:22:17,238 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-16 12:22:17,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2022-11-16 12:22:17,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:22:17,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-16 12:22:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:17,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:22:17,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504560289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:17,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:22:17,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 17 [2022-11-16 12:22:17,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181346895] [2022-11-16 12:22:17,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:17,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:22:17,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:17,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:22:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:22:17,563 INFO L87 Difference]: Start difference. First operand 171 states and 221 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 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-11-16 12:22:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:18,101 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2022-11-16 12:22:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:22:18,101 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 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) Word has length 37 [2022-11-16 12:22:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:18,103 INFO L225 Difference]: With dead ends: 210 [2022-11-16 12:22:18,103 INFO L226 Difference]: Without dead ends: 210 [2022-11-16 12:22:18,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-11-16 12:22:18,105 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 362 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:18,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 389 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:22:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-16 12:22:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 171. [2022-11-16 12:22:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 170 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2022-11-16 12:22:18,112 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 37 [2022-11-16 12:22:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:18,112 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2022-11-16 12:22:18,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 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-11-16 12:22:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2022-11-16 12:22:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:22:18,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:18,114 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:18,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:18,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-16 12:22:18,321 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:22:18,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:18,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679629, now seen corresponding path program 1 times [2022-11-16 12:22:18,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:18,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65808581] [2022-11-16 12:22:18,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:18,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:18,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:18,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65808581] [2022-11-16 12:22:18,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65808581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:18,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552460750] [2022-11-16 12:22:18,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:18,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:18,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:18,753 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:18,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:22:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 12:22:18,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:19,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:22:19,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:22:19,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:22:19,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:19,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2022-11-16 12:22:19,260 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-16 12:22:19,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2022-11-16 12:22:19,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:22:19,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-16 12:22:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:19,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:22:19,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552460750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:19,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:22:19,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2022-11-16 12:22:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693481810] [2022-11-16 12:22:19,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:19,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:22:19,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:19,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:22:19,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:22:19,515 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 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-11-16 12:22:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:20,235 INFO L93 Difference]: Finished difference Result 196 states and 223 transitions. [2022-11-16 12:22:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:22:20,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 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) Word has length 37 [2022-11-16 12:22:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:20,237 INFO L225 Difference]: With dead ends: 196 [2022-11-16 12:22:20,237 INFO L226 Difference]: Without dead ends: 196 [2022-11-16 12:22:20,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-11-16 12:22:20,239 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 259 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:20,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 474 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:22:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-16 12:22:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2022-11-16 12:22:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 170 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2022-11-16 12:22:20,246 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 37 [2022-11-16 12:22:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:20,246 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2022-11-16 12:22:20,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 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-11-16 12:22:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2022-11-16 12:22:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 12:22:20,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:20,248 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:20,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:20,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:20,456 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:22:20,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash 507133380, now seen corresponding path program 1 times [2022-11-16 12:22:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:20,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275183043] [2022-11-16 12:22:20,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:20,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:20,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275183043] [2022-11-16 12:22:20,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275183043] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:20,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97795762] [2022-11-16 12:22:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:20,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:20,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:20,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:20,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:22:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:21,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:22:21,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:21,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:22:21,094 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:22:21,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:22:21,116 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:22:21,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:22:21,136 INFO L350 Elim1Store]: Elim1 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-11-16 12:22:21,153 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:22:21,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-16 12:22:21,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-16 12:22:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:21,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:21,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) |c_ULTIMATE.start_main_~data~0#1.base|))) is different from false [2022-11-16 12:22:21,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:21,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-16 12:22:21,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2022-11-16 12:22:21,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 12:22:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 12:22:21,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97795762] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:21,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:21,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-11-16 12:22:21,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236555286] [2022-11-16 12:22:21,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:21,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:22:21,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:21,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:22:21,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-11-16 12:22:21,321 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 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-11-16 12:22:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:21,809 INFO L93 Difference]: Finished difference Result 171 states and 216 transitions. [2022-11-16 12:22:21,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:22:21,810 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 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 40 [2022-11-16 12:22:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:21,811 INFO L225 Difference]: With dead ends: 171 [2022-11-16 12:22:21,811 INFO L226 Difference]: Without dead ends: 171 [2022-11-16 12:22:21,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=251, Unknown=1, NotChecked=34, Total=380 [2022-11-16 12:22:21,813 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 96 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:21,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 317 Invalid, 0 Unknown, 76 Unchecked, 0.3s Time] [2022-11-16 12:22:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-16 12:22:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2022-11-16 12:22:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.6589147286821706) internal successors, (214), 166 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 214 transitions. [2022-11-16 12:22:21,820 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 214 transitions. Word has length 40 [2022-11-16 12:22:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:21,820 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 214 transitions. [2022-11-16 12:22:21,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 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-11-16 12:22:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 214 transitions. [2022-11-16 12:22:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:22:21,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:21,822 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:21,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:22,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:22,031 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:22:22,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:22,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299147, now seen corresponding path program 1 times [2022-11-16 12:22:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:22,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415519843] [2022-11-16 12:22:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:22,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:22:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415519843] [2022-11-16 12:22:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415519843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:22,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:22,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:22:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575810657] [2022-11-16 12:22:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:22,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:22:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:22,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:22:22,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:22:22,174 INFO L87 Difference]: Start difference. First operand 167 states and 214 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:22,462 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2022-11-16 12:22:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:22:22,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-16 12:22:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:22,464 INFO L225 Difference]: With dead ends: 166 [2022-11-16 12:22:22,464 INFO L226 Difference]: Without dead ends: 166 [2022-11-16 12:22:22,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:22:22,465 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:22,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 305 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:22:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-16 12:22:22,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-11-16 12:22:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 165 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2022-11-16 12:22:22,470 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 41 [2022-11-16 12:22:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:22,471 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2022-11-16 12:22:22,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2022-11-16 12:22:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:22:22,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:22,472 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:22,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 12:22:22,472 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:22:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299146, now seen corresponding path program 1 times [2022-11-16 12:22:22,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:22,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152484046] [2022-11-16 12:22:22,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:22,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:23,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:23,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152484046] [2022-11-16 12:22:23,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152484046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:23,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26341830] [2022-11-16 12:22:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:23,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:23,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:23,083 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:23,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:22:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:23,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 12:22:23,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:23,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:22:23,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:23,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 12:22:23,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-16 12:22:23,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-16 12:22:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:23,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:22:23,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26341830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:23,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:22:23,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2022-11-16 12:22:23,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436908448] [2022-11-16 12:22:23,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:23,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:22:23,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:23,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:22:23,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:22:23,809 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 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-11-16 12:22:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:24,683 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2022-11-16 12:22:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:22:24,684 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 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) Word has length 41 [2022-11-16 12:22:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:24,685 INFO L225 Difference]: With dead ends: 226 [2022-11-16 12:22:24,686 INFO L226 Difference]: Without dead ends: 226 [2022-11-16 12:22:24,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-11-16 12:22:24,687 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 311 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:24,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 533 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:22:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-16 12:22:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 166. [2022-11-16 12:22:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.627906976744186) internal successors, (210), 165 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2022-11-16 12:22:24,694 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 41 [2022-11-16 12:22:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:24,694 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2022-11-16 12:22:24,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 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-11-16 12:22:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2022-11-16 12:22:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 12:22:24,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:24,696 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:24,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:24,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:24,908 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:22:24,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash -716785192, now seen corresponding path program 1 times [2022-11-16 12:22:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:24,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436254713] [2022-11-16 12:22:24,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:25,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:25,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436254713] [2022-11-16 12:22:25,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436254713] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:25,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009363667] [2022-11-16 12:22:25,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:25,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:25,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:25,403 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:25,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:22:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:25,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 12:22:25,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:25,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:22:25,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:25,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 12:22:25,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 12:22:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:25,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:26,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009363667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:26,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:26,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-11-16 12:22:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157301528] [2022-11-16 12:22:26,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:26,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:22:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:26,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:22:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:22:26,261 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:27,294 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2022-11-16 12:22:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 12:22:27,295 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 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 45 [2022-11-16 12:22:27,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:27,297 INFO L225 Difference]: With dead ends: 186 [2022-11-16 12:22:27,297 INFO L226 Difference]: Without dead ends: 186 [2022-11-16 12:22:27,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=341, Invalid=1219, Unknown=0, NotChecked=0, Total=1560 [2022-11-16 12:22:27,299 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 700 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:27,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 574 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 444 Invalid, 0 Unknown, 11 Unchecked, 0.5s Time] [2022-11-16 12:22:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-16 12:22:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2022-11-16 12:22:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.62015503875969) internal successors, (209), 165 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2022-11-16 12:22:27,305 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 45 [2022-11-16 12:22:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:27,306 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2022-11-16 12:22:27,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2022-11-16 12:22:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 12:22:27,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:27,307 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:27,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:27,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 12:22:27,524 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:22:27,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:27,524 INFO L85 PathProgramCache]: Analyzing trace with hash 829868235, now seen corresponding path program 1 times [2022-11-16 12:22:27,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:27,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88049787] [2022-11-16 12:22:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:27,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:29,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:29,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88049787] [2022-11-16 12:22:29,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88049787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:29,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824109522] [2022-11-16 12:22:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:29,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:29,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:29,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:29,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:22:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:29,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 12:22:29,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:29,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:22:29,731 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:22:29,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:22:29,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:22:30,004 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-16 12:22:30,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-11-16 12:22:30,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-16 12:22:30,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-16 12:22:30,324 INFO L321 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2022-11-16 12:22:30,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 53 [2022-11-16 12:22:30,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-16 12:22:30,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:30,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-16 12:22:30,837 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:22:30,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2022-11-16 12:22:31,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:22:31,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:31,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 28 [2022-11-16 12:22:31,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:22:32,304 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:22:32,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2022-11-16 12:22:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:32,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:33,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-16 12:22:33,409 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (= 1 (let ((.cse4 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse4 .cse3))))))) (and (or (< 0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 1)) .cse0) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| 1) .cse0) (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|) (= 1 (select (store |c_#valid| .cse1 v_ArrVal_1368) (select .cse2 .cse3)))))))))) is different from false [2022-11-16 12:22:33,450 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)))) (let ((.cse4 (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (= (let ((.cse5 (select (store .cse3 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse5 .cse2))) 1)))) (and (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse1 (select (store .cse3 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= (select (store |c_#valid| .cse0 v_ArrVal_1368) (select .cse1 .cse2)) 1) (= |c_ULTIMATE.start_main_~data~0#1.base| .cse0))))) (or (< 0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 1)) .cse4) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| 1) .cse4)))) is different from false [2022-11-16 12:22:33,520 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1368 Int)) (= (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse6 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1368) (select .cse5 .cse3))) 1)))) (and (or (< 0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 1)) .cse0) (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1364 (Array Int Int)) (v_ArrVal_1368 Int)) (let ((.cse2 (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1364))) (store .cse4 |c_ULTIMATE.start_main_~data~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|))) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|))) (or (= (select (store |c_#valid| .cse1 v_ArrVal_1368) (select .cse2 .cse3)) 1) (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|))))) (or (< |c_ULTIMATE.start_main_~data~0#1.offset| 1) .cse0)))) is different from false [2022-11-16 12:22:34,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:34,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 111 [2022-11-16 12:22:34,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:22:34,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 577 treesize of output 570 [2022-11-16 12:22:34,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 555 treesize of output 491 [2022-11-16 12:22:34,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 366 [2022-11-16 12:22:34,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 350 [2022-11-16 12:23:14,315 WARN L233 SmtUtils]: Spent 23.09s on a formula simplification. DAG size of input: 328 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:23:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 12:23:17,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824109522] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:23:17,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:23:17,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 21] total 51 [2022-11-16 12:23:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457412849] [2022-11-16 12:23:17,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:23:17,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-16 12:23:17,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-16 12:23:17,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2075, Unknown=6, NotChecked=288, Total=2652 [2022-11-16 12:23:17,326 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand has 52 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 52 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:22,948 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-11-16 12:23:22,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:23:22,948 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 52 states have internal predecessors, (136), 0 states have call successors, (0), 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 48 [2022-11-16 12:23:22,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:22,949 INFO L225 Difference]: With dead ends: 166 [2022-11-16 12:23:22,950 INFO L226 Difference]: Without dead ends: 166 [2022-11-16 12:23:22,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=457, Invalid=3089, Unknown=6, NotChecked=354, Total=3906 [2022-11-16 12:23:22,951 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 957 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:22,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1200 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 608 Invalid, 0 Unknown, 957 Unchecked, 0.6s Time] [2022-11-16 12:23:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-16 12:23:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2022-11-16 12:23:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 127 states have (on average 1.6062992125984252) internal successors, (204), 163 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2022-11-16 12:23:22,956 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 48 [2022-11-16 12:23:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:22,956 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2022-11-16 12:23:22,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 52 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2022-11-16 12:23:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-16 12:23:22,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:22,957 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:23:22,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:23:23,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 12:23:23,164 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-16 12:23:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash 829868236, now seen corresponding path program 1 times [2022-11-16 12:23:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:23,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436380428] [2022-11-16 12:23:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:25,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:25,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436380428] [2022-11-16 12:23:25,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436380428] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:23:25,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11954302] [2022-11-16 12:23:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:25,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:23:25,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:23:25,159 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:23:25,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_643a7737-0ac6-48fd-9cc6-b8e2a4488ecc/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:23:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:25,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-16 12:23:25,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:23:25,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:23:25,525 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:23:25,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:23:25,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:23:25,722 INFO L350 Elim1Store]: Elim1 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-11-16 12:23:25,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:23:25,852 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 12:23:25,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-16 12:23:25,907 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-16 12:23:25,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-11-16 12:23:26,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-16 12:23:26,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:23:26,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:23:26,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-16 12:23:26,237 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 12:23:26,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-16 12:23:26,280 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-16 12:23:26,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 12:23:26,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:23:26,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-16 12:23:26,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:26,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-16 12:23:26,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:26,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-16 12:23:26,710 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:23:26,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2022-11-16 12:23:26,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-16 12:23:27,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:23:27,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:27,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 31 [2022-11-16 12:23:27,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:23:27,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:27,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2022-11-16 12:23:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:27,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:23:35,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:23:35,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 309 treesize of output 279 [2022-11-16 12:23:35,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:23:35,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 461 treesize of output 311 [2022-11-16 12:23:35,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:23:35,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1215 treesize of output 1214 [2022-11-16 12:23:35,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:23:35,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7757 treesize of output 7695 [2022-11-16 12:23:35,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2122 treesize of output 2058 [2022-11-16 12:23:35,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9267 treesize of output 8867 [2022-11-16 12:23:36,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 8299 treesize of output 7771 [2022-11-16 12:23:36,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8481 treesize of output 8385 [2022-11-16 12:23:36,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4438 treesize of output 4254 [2022-11-16 12:23:36,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-16 12:23:39,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:23:39,767 INFO L350 Elim1Store]: Elim1 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 4112 treesize of output 4108 [2022-11-16 12:28:07,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:28:07,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 143 [2022-11-16 12:28:07,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1792 treesize of output 1786 [2022-11-16 12:28:07,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:28:07,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2073 treesize of output 1323 [2022-11-16 12:28:07,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:28:07,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6855 treesize of output 6819 [2022-11-16 12:28:07,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5942 treesize of output 5686 [2022-11-16 12:28:07,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 7813 treesize of output 7629 [2022-11-16 12:28:07,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7543 treesize of output 7531 [2022-11-16 12:28:07,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-16 12:28:07,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:28:07,705 INFO L350 Elim1Store]: Elim1 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 7596 treesize of output 7592