./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/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_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/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_668d7d45-3845-489c-b70b-62bc99d3a6d5/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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- 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 10:54:22,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:54:22,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:54:22,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:54:22,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:54:22,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:54:22,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:54:22,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:54:22,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:54:22,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:54:22,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:54:22,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:54:22,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:54:23,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:54:23,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:54:23,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:54:23,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:54:23,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:54:23,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:54:23,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:54:23,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:54:23,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:54:23,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:54:23,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:54:23,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:54:23,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:54:23,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:54:23,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:54:23,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:54:23,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:54:23,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:54:23,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:54:23,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:54:23,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:54:23,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:54:23,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:54:23,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:54:23,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:54:23,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:54:23,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:54:23,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:54:23,059 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 10:54:23,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:54:23,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:54:23,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:54:23,115 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:54:23,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:54:23,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:54:23,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:54:23,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:54:23,118 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:54:23,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:54:23,119 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:54:23,119 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 10:54:23,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:54:23,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:54:23,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:54:23,121 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 10:54:23,121 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 10:54:23,121 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 10:54:23,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:54:23,122 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 10:54:23,122 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:54:23,123 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:54:23,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:54:23,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:54:23,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:54:23,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:54:23,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:54:23,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:54:23,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:54:23,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:54:23,126 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_668d7d45-3845-489c-b70b-62bc99d3a6d5/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_668d7d45-3845-489c-b70b-62bc99d3a6d5/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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2022-11-16 10:54:23,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:54:23,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:54:23,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:54:23,560 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:54:23,561 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:54:23,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-11-16 10:54:23,653 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/data/642d8a2cc/2a279c2c63fa4d6aa4e7664bd0c2ae2a/FLAGde9ac39a3 [2022-11-16 10:54:24,410 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:54:24,411 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-11-16 10:54:24,425 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/data/642d8a2cc/2a279c2c63fa4d6aa4e7664bd0c2ae2a/FLAGde9ac39a3 [2022-11-16 10:54:24,634 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/data/642d8a2cc/2a279c2c63fa4d6aa4e7664bd0c2ae2a [2022-11-16 10:54:24,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:54:24,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:54:24,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:54:24,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:54:24,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:54:24,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:54:24" (1/1) ... [2022-11-16 10:54:24,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3129ba5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:24, skipping insertion in model container [2022-11-16 10:54:24,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:54:24" (1/1) ... [2022-11-16 10:54:24,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:54:24,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:54:25,332 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2022-11-16 10:54:25,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:54:25,360 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:54:25,423 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/sv-benchmarks/c/list-simple/sll2c_update_all.i[24418,24431] [2022-11-16 10:54:25,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:54:25,470 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:54:25,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25 WrapperNode [2022-11-16 10:54:25,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:54:25,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:54:25,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:54:25,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:54:25,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,577 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-11-16 10:54:25,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:54:25,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:54:25,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:54:25,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:54:25,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,639 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:54:25,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:54:25,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:54:25,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:54:25,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (1/1) ... [2022-11-16 10:54:25,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:54:25,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:25,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:54:25,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:54:25,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 10:54:25,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 10:54:25,753 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 10:54:25,753 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 10:54:25,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 10:54:25,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:54:25,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 10:54:25,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 10:54:25,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:54:25,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:54:25,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:54:25,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:54:25,978 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:54:25,981 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:54:26,428 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:54:26,443 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:54:26,444 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-16 10:54:26,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:54:26 BoogieIcfgContainer [2022-11-16 10:54:26,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:54:26,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:54:26,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:54:26,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:54:26,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:54:24" (1/3) ... [2022-11-16 10:54:26,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8a550c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:54:26, skipping insertion in model container [2022-11-16 10:54:26,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:25" (2/3) ... [2022-11-16 10:54:26,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8a550c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:54:26, skipping insertion in model container [2022-11-16 10:54:26,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:54:26" (3/3) ... [2022-11-16 10:54:26,463 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2022-11-16 10:54:26,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:54:26,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-16 10:54:26,554 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:54:26,564 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;@10d216ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:54:26,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-11-16 10:54:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 10:54:26,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:26,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 10:54:26,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-11-16 10:54:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:26,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626026119] [2022-11-16 10:54:26,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:26,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:26,962 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 10:54:26,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:26,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626026119] [2022-11-16 10:54:26,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626026119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:26,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:26,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:54:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321857751] [2022-11-16 10:54:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:26,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:54:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:54:27,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:54:27,017 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:54:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:27,189 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-11-16 10:54:27,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:54:27,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 10:54:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:27,209 INFO L225 Difference]: With dead ends: 81 [2022-11-16 10:54:27,210 INFO L226 Difference]: Without dead ends: 78 [2022-11-16 10:54:27,214 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 10:54:27,222 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:27,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:54:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-16 10:54:27,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-16 10:54:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-11-16 10:54:27,276 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-11-16 10:54:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:27,276 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-11-16 10:54:27,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:54:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-11-16 10:54:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 10:54:27,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:27,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 10:54:27,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 10:54:27,279 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-11-16 10:54:27,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:27,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422038846] [2022-11-16 10:54:27,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:27,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:27,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 10:54:27,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:27,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422038846] [2022-11-16 10:54:27,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422038846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:27,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:27,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:54:27,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115615910] [2022-11-16 10:54:27,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:27,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:54:27,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:27,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:54:27,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:54:27,540 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:54:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:27,660 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-16 10:54:27,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:54:27,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 10:54:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:27,663 INFO L225 Difference]: With dead ends: 76 [2022-11-16 10:54:27,663 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 10:54:27,664 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 10:54:27,666 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:27,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:54:27,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 10:54:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-16 10:54:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-11-16 10:54:27,685 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-11-16 10:54:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:27,686 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-11-16 10:54:27,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:54:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-11-16 10:54:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:54:27,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:27,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:54:27,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 10:54:27,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-11-16 10:54:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:27,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115026727] [2022-11-16 10:54:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:27,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:27,939 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 10:54:27,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:27,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115026727] [2022-11-16 10:54:27,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115026727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:27,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:27,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:54:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935294510] [2022-11-16 10:54:27,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:27,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:54:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:27,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:54:27,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:54:27,943 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 10:54:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:28,084 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-11-16 10:54:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:54:28,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-16 10:54:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:28,087 INFO L225 Difference]: With dead ends: 83 [2022-11-16 10:54:28,087 INFO L226 Difference]: Without dead ends: 83 [2022-11-16 10:54:28,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:54:28,090 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:28,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:54:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-16 10:54:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-11-16 10:54:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-11-16 10:54:28,103 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-11-16 10:54:28,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:28,104 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-11-16 10:54:28,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 10:54:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-11-16 10:54:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 10:54:28,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:28,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:54:28,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 10:54:28,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-11-16 10:54:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:28,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199184668] [2022-11-16 10:54:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:28,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 10:54:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:28,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199184668] [2022-11-16 10:54:28,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199184668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:28,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:28,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:54:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423692187] [2022-11-16 10:54:28,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:28,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:54:28,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:28,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:54:28,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:54:28,389 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:28,706 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-11-16 10:54:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:54:28,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-16 10:54:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:28,718 INFO L225 Difference]: With dead ends: 97 [2022-11-16 10:54:28,718 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 10:54:28,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:54:28,721 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:28,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:54:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 10:54:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-11-16 10:54:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-11-16 10:54:28,732 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-11-16 10:54:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:28,733 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-11-16 10:54:28,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-11-16 10:54:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 10:54:28,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:28,735 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:54:28,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 10:54:28,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:28,737 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-11-16 10:54:28,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:28,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606568021] [2022-11-16 10:54:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:28,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:29,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:54:29,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:29,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606568021] [2022-11-16 10:54:29,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606568021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:29,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:29,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:54:29,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548132961] [2022-11-16 10:54:29,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:29,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:54:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:29,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:54:29,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:54:29,177 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:29,399 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-16 10:54:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:54:29,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-16 10:54:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:29,401 INFO L225 Difference]: With dead ends: 76 [2022-11-16 10:54:29,402 INFO L226 Difference]: Without dead ends: 76 [2022-11-16 10:54:29,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:54:29,404 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:29,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:54:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-16 10:54:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-11-16 10:54:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-11-16 10:54:29,413 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-11-16 10:54:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:29,414 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-11-16 10:54:29,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-11-16 10:54:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 10:54:29,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:29,416 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:54:29,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 10:54:29,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:29,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:29,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-11-16 10:54:29,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:29,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909122924] [2022-11-16 10:54:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:29,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:29,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:29,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 10:54:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:29,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909122924] [2022-11-16 10:54:29,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909122924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:29,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227595938] [2022-11-16 10:54:29,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:29,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:29,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:29,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:29,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 10:54:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:30,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 10:54:30,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:30,186 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 10:54:30,325 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_242 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_242))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 10:54:30,505 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 10:54:30,506 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 10:54:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-16 10:54:30,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:54:30,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227595938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:30,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:54:30,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-16 10:54:30,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841605343] [2022-11-16 10:54:30,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:54:30,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:54:30,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:30,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:54:30,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-16 10:54:30,687 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 10:54:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:31,014 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-11-16 10:54:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:54:31,015 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-11-16 10:54:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:31,017 INFO L225 Difference]: With dead ends: 94 [2022-11-16 10:54:31,018 INFO L226 Difference]: Without dead ends: 94 [2022-11-16 10:54:31,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-16 10:54:31,027 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:31,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 308 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2022-11-16 10:54:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-16 10:54:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2022-11-16 10:54:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-11-16 10:54:31,047 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2022-11-16 10:54:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:31,048 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-11-16 10:54:31,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 10:54:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-11-16 10:54:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 10:54:31,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:31,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:54:31,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 10:54:31,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:31,258 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:31,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:31,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-11-16 10:54:31,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:31,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269184024] [2022-11-16 10:54:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:31,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:54:31,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:31,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269184024] [2022-11-16 10:54:31,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269184024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:31,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466930437] [2022-11-16 10:54:31,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:31,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:31,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:31,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:32,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 10:54:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:32,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 10:54:32,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:32,165 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 10:54:32,500 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_343 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_343) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 10:54:32,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:54:32,602 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 10:54:32,615 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:54:32,616 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 10:54:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 10:54:32,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:54:32,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466930437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:32,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:54:32,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-11-16 10:54:32,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025795798] [2022-11-16 10:54:32,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:54:32,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 10:54:32,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:32,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 10:54:32,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2022-11-16 10:54:32,876 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 10:54:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:33,428 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-11-16 10:54:33,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:54:33,429 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-11-16 10:54:33,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:33,430 INFO L225 Difference]: With dead ends: 94 [2022-11-16 10:54:33,430 INFO L226 Difference]: Without dead ends: 94 [2022-11-16 10:54:33,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2022-11-16 10:54:33,432 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 180 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:33,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 408 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 324 Invalid, 0 Unknown, 96 Unchecked, 0.4s Time] [2022-11-16 10:54:33,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-16 10:54:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-11-16 10:54:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-11-16 10:54:33,439 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2022-11-16 10:54:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:33,440 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-11-16 10:54:33,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 10:54:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-11-16 10:54:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 10:54:33,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:33,442 INFO L195 NwaCegarLoop]: trace histogram [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 10:54:33,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 10:54:33,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 10:54:33,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-11-16 10:54:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:33,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819490468] [2022-11-16 10:54:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:33,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:33,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 10:54:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:33,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819490468] [2022-11-16 10:54:33,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819490468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:33,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:33,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 10:54:33,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529856555] [2022-11-16 10:54:33,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:33,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:54:33,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:33,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:54:33,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:54:33,927 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:34,288 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-11-16 10:54:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:54:34,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-16 10:54:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:34,292 INFO L225 Difference]: With dead ends: 142 [2022-11-16 10:54:34,292 INFO L226 Difference]: Without dead ends: 142 [2022-11-16 10:54:34,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-16 10:54:34,293 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:34,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:54:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-16 10:54:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2022-11-16 10:54:34,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-11-16 10:54:34,311 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2022-11-16 10:54:34,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:34,312 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-11-16 10:54:34,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-11-16 10:54:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 10:54:34,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:34,315 INFO L195 NwaCegarLoop]: trace histogram [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 10:54:34,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 10:54:34,315 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:34,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:34,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2022-11-16 10:54:34,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:34,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383646353] [2022-11-16 10:54:34,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:34,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:34,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:34,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:54:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:34,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383646353] [2022-11-16 10:54:34,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383646353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:34,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:34,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 10:54:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149004206] [2022-11-16 10:54:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:34,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:54:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:34,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:54:34,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:54:34,730 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:35,092 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2022-11-16 10:54:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:54:35,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-16 10:54:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:35,094 INFO L225 Difference]: With dead ends: 123 [2022-11-16 10:54:35,094 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 10:54:35,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-16 10:54:35,095 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 323 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:35,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 485 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:54:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 10:54:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 76. [2022-11-16 10:54:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.509433962264151) internal successors, (80), 72 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-11-16 10:54:35,109 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 30 [2022-11-16 10:54:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:35,109 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-11-16 10:54:35,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-11-16 10:54:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 10:54:35,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:35,110 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 10:54:35,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 10:54:35,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2022-11-16 10:54:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:35,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200533256] [2022-11-16 10:54:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:35,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:35,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:35,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:35,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200533256] [2022-11-16 10:54:35,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200533256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:35,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:35,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:54:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927457286] [2022-11-16 10:54:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:35,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:54:35,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:35,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:54:35,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:54:35,247 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:35,354 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-11-16 10:54:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:54:35,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-16 10:54:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:35,356 INFO L225 Difference]: With dead ends: 155 [2022-11-16 10:54:35,357 INFO L226 Difference]: Without dead ends: 155 [2022-11-16 10:54:35,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:54:35,358 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 88 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:35,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 297 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:54:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-16 10:54:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 78. [2022-11-16 10:54:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.509090909090909) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-11-16 10:54:35,366 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 32 [2022-11-16 10:54:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:35,367 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-11-16 10:54:35,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-11-16 10:54:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 10:54:35,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:35,372 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 10:54:35,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 10:54:35,373 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:35,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:35,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333233, now seen corresponding path program 1 times [2022-11-16 10:54:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:35,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223901481] [2022-11-16 10:54:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:35,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 10:54:35,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:35,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223901481] [2022-11-16 10:54:35,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223901481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:35,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:35,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 10:54:35,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211983132] [2022-11-16 10:54:35,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:35,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:54:35,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:35,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:54:35,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:54:35,598 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:35,958 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-11-16 10:54:35,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:54:35,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-16 10:54:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:35,959 INFO L225 Difference]: With dead ends: 130 [2022-11-16 10:54:35,960 INFO L226 Difference]: Without dead ends: 130 [2022-11-16 10:54:35,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-16 10:54:35,961 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 296 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:35,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 412 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:54:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-16 10:54:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 81. [2022-11-16 10:54:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 77 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-11-16 10:54:35,966 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 32 [2022-11-16 10:54:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:35,966 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-11-16 10:54:35,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-11-16 10:54:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 10:54:35,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:35,968 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 10:54:35,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 10:54:35,968 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:35,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333232, now seen corresponding path program 1 times [2022-11-16 10:54:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:35,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196957342] [2022-11-16 10:54:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:35,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:36,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 10:54:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:36,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196957342] [2022-11-16 10:54:36,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196957342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:36,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781597630] [2022-11-16 10:54:36,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:36,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:36,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:36,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:36,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 10:54:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:36,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 10:54:36,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:36,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:54:36,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781597630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:36,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:54:36,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-16 10:54:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47802634] [2022-11-16 10:54:36,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:36,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:54:36,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:36,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:54:36,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:54:36,358 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:36,392 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2022-11-16 10:54:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:54:36,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-16 10:54:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:36,396 INFO L225 Difference]: With dead ends: 103 [2022-11-16 10:54:36,396 INFO L226 Difference]: Without dead ends: 103 [2022-11-16 10:54:36,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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 10:54:36,398 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 101 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:36,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 141 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 10:54:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-16 10:54:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2022-11-16 10:54:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 78 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2022-11-16 10:54:36,406 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 32 [2022-11-16 10:54:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:36,407 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2022-11-16 10:54:36,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-11-16 10:54:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 10:54:36,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:36,412 INFO L195 NwaCegarLoop]: trace histogram [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 10:54:36,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 10:54:36,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 10:54:36,619 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:36,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:36,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-11-16 10:54:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:36,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803906645] [2022-11-16 10:54:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:36,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:36,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:36,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:36,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:36,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803906645] [2022-11-16 10:54:36,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803906645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:36,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:54:36,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:54:36,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808136238] [2022-11-16 10:54:36,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:36,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:54:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:54:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:54:36,754 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:36,876 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-11-16 10:54:36,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:54:36,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-16 10:54:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:36,878 INFO L225 Difference]: With dead ends: 150 [2022-11-16 10:54:36,878 INFO L226 Difference]: Without dead ends: 150 [2022-11-16 10:54:36,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:54:36,880 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 82 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:36,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 258 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:54:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-16 10:54:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2022-11-16 10:54:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.5) internal successors, (90), 79 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-11-16 10:54:36,885 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 33 [2022-11-16 10:54:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:36,886 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-11-16 10:54:36,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:36,887 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-11-16 10:54:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 10:54:36,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:36,913 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 10:54:36,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 10:54:36,913 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:36,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash 274321452, now seen corresponding path program 1 times [2022-11-16 10:54:36,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:36,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227846396] [2022-11-16 10:54:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:36,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:37,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:37,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 10:54:37,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:37,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227846396] [2022-11-16 10:54:37,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227846396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:37,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170762168] [2022-11-16 10:54:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:37,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:37,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:37,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:37,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 10:54:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:37,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 10:54:37,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:37,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:54:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:37,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170762168] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:54:37,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:54:37,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-11-16 10:54:37,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152135229] [2022-11-16 10:54:37,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:54:37,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 10:54:37,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:37,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 10:54:37,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 10:54:37,570 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 10:54:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:37,724 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2022-11-16 10:54:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:54:37,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-11-16 10:54:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:37,727 INFO L225 Difference]: With dead ends: 130 [2022-11-16 10:54:37,727 INFO L226 Difference]: Without dead ends: 130 [2022-11-16 10:54:37,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:54:37,728 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 150 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:37,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 355 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:54:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-16 10:54:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2022-11-16 10:54:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:37,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2022-11-16 10:54:37,735 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 37 [2022-11-16 10:54:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:37,737 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2022-11-16 10:54:37,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 10:54:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-11-16 10:54:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 10:54:37,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:37,738 INFO L195 NwaCegarLoop]: trace histogram [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 10:54:37,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 10:54:37,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 10:54:37,945 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:37,946 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2022-11-16 10:54:37,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:37,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406818906] [2022-11-16 10:54:37,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:37,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:38,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:54:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:38,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406818906] [2022-11-16 10:54:38,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406818906] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:38,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117189715] [2022-11-16 10:54:38,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:38,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:38,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:38,885 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:38,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 10:54:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:39,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 10:54:39,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:39,089 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 10:54:39,186 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:54:39,186 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 10:54:39,205 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 10:54:39,284 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:54:39,284 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 28 treesize of output 29 [2022-11-16 10:54:39,525 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 10:54:39,525 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 31 treesize of output 32 [2022-11-16 10:54:39,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:54:39,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:54:39,800 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 25 treesize of output 16 [2022-11-16 10:54:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:54:39,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:54:40,599 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-16 10:54:40,600 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 19 treesize of output 18 [2022-11-16 10:54:40,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:54:40,835 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 18 treesize of output 19 [2022-11-16 10:54:40,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:54:40,847 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 30 treesize of output 30 [2022-11-16 10:54:40,853 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 9 treesize of output 7 [2022-11-16 10:54:41,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117189715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:41,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:54:41,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2022-11-16 10:54:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88676069] [2022-11-16 10:54:41,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:54:41,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 10:54:41,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:41,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 10:54:41,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 10:54:41,123 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:42,985 INFO L93 Difference]: Finished difference Result 221 states and 249 transitions. [2022-11-16 10:54:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 10:54:42,986 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-11-16 10:54:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:42,987 INFO L225 Difference]: With dead ends: 221 [2022-11-16 10:54:42,988 INFO L226 Difference]: Without dead ends: 221 [2022-11-16 10:54:42,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=317, Invalid=2233, Unknown=0, NotChecked=0, Total=2550 [2022-11-16 10:54:42,989 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 971 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:42,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1189 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 968 Invalid, 0 Unknown, 109 Unchecked, 0.7s Time] [2022-11-16 10:54:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-16 10:54:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 117. [2022-11-16 10:54:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 112 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 10:54:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2022-11-16 10:54:42,998 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 38 [2022-11-16 10:54:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:42,998 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2022-11-16 10:54:42,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:54:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-11-16 10:54:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-16 10:54:43,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:43,000 INFO L195 NwaCegarLoop]: trace histogram [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 10:54:43,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 10:54:43,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:43,210 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:43,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2022-11-16 10:54:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:43,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908218114] [2022-11-16 10:54:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:43,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:44,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:54:44,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:44,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908218114] [2022-11-16 10:54:44,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908218114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:44,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549602331] [2022-11-16 10:54:44,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:44,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:44,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:44,556 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:44,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 10:54:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:44,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-16 10:54:44,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:44,747 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 10:54:45,179 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:54:45,180 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 10:54:45,189 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8))) (or (<= .cse0 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= .cse0 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse1) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse1 (select |c_#length| .cse1)))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) is different from false [2022-11-16 10:54:45,192 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8))) (or (<= .cse0 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= .cse0 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse1) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse1 (select |c_#length| .cse1)))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) is different from true [2022-11-16 10:54:45,279 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 10:54:45,286 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 10:54:45,456 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:54:45,456 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 44 treesize of output 43 [2022-11-16 10:54:45,461 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 33 treesize of output 33 [2022-11-16 10:54:45,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:54:45,752 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 37 treesize of output 32 [2022-11-16 10:54:45,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:54:45,759 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 36 treesize of output 31 [2022-11-16 10:54:45,879 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 31 treesize of output 19 [2022-11-16 10:54:45,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-16 10:54:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:54:45,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:54:46,801 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1167) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1168 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) is different from false [2022-11-16 10:54:46,827 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1167 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1167) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1168 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)))) is different from false [2022-11-16 10:54:46,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:54:46,837 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 37 treesize of output 38 [2022-11-16 10:54:46,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:54:46,843 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 29 treesize of output 30 [2022-11-16 10:54:46,847 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 52 treesize of output 44 [2022-11-16 10:54:46,851 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 82 treesize of output 70 [2022-11-16 10:54:46,856 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 34 treesize of output 30 [2022-11-16 10:54:46,859 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 62 treesize of output 58 [2022-11-16 10:54:46,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:54:46,896 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 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-16 10:54:46,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:54:46,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-16 10:54:49,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549602331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:49,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:54:49,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2022-11-16 10:54:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369811805] [2022-11-16 10:54:49,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:54:49,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 10:54:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:49,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 10:54:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2121, Unknown=4, NotChecked=282, Total=2550 [2022-11-16 10:54:49,202 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 33 states have internal predecessors, (61), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 10:54:49,587 WARN L833 $PredicateComparison]: unable to prove that (and (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8))) (or (<= .cse0 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= .cse0 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse1) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse1 (select |c_#length| .cse1)))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) is different from false [2022-11-16 10:54:49,590 WARN L855 $PredicateComparison]: unable to prove that (and (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8))) (or (<= .cse0 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= .cse0 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse1) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse1 (select |c_#length| .cse1)))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) is different from true [2022-11-16 10:54:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:51,911 INFO L93 Difference]: Finished difference Result 252 states and 293 transitions. [2022-11-16 10:54:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 10:54:51,911 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 33 states have internal predecessors, (61), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-11-16 10:54:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:51,913 INFO L225 Difference]: With dead ends: 252 [2022-11-16 10:54:51,913 INFO L226 Difference]: Without dead ends: 252 [2022-11-16 10:54:51,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=348, Invalid=3084, Unknown=6, NotChecked=468, Total=3906 [2022-11-16 10:54:51,915 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 1353 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:51,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 2039 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1489 Invalid, 0 Unknown, 145 Unchecked, 1.2s Time] [2022-11-16 10:54:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-16 10:54:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 125. [2022-11-16 10:54:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 120 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 10:54:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2022-11-16 10:54:51,920 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 38 [2022-11-16 10:54:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:51,920 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2022-11-16 10:54:51,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 33 states have internal predecessors, (61), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 10:54:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2022-11-16 10:54:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 10:54:51,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:51,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2022-11-16 10:54:51,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 10:54:52,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:52,122 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:52,122 INFO L85 PathProgramCache]: Analyzing trace with hash 766820837, now seen corresponding path program 2 times [2022-11-16 10:54:52,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:52,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627944719] [2022-11-16 10:54:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:52,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:52,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:52,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:52,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:52,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627944719] [2022-11-16 10:54:52,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627944719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:52,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108323866] [2022-11-16 10:54:52,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:54:52,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:52,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:52,270 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:52,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 10:54:52,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:54:52,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:54:52,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 10:54:52,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 10:54:52,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:54:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 10:54:52,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108323866] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:54:52,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:54:52,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2022-11-16 10:54:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066774024] [2022-11-16 10:54:52,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:54:52,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:54:52,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:52,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:54:52,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:54:52,590 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 10:54:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:52,718 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2022-11-16 10:54:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:54:52,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-16 10:54:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:52,719 INFO L225 Difference]: With dead ends: 124 [2022-11-16 10:54:52,719 INFO L226 Difference]: Without dead ends: 124 [2022-11-16 10:54:52,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-16 10:54:52,720 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 241 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:52,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 198 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:54:52,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-16 10:54:52,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2022-11-16 10:54:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 116 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 10:54:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2022-11-16 10:54:52,724 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 41 [2022-11-16 10:54:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:52,724 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2022-11-16 10:54:52,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 10:54:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2022-11-16 10:54:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 10:54:52,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:52,724 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2022-11-16 10:54:52,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 10:54:52,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 10:54:52,933 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:52,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash -168412912, now seen corresponding path program 2 times [2022-11-16 10:54:52,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:52,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305929903] [2022-11-16 10:54:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:53,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:53,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305929903] [2022-11-16 10:54:53,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305929903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:53,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784734234] [2022-11-16 10:54:53,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:54:53,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:53,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:53,175 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:53,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 10:54:53,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 10:54:53,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:54:53,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 10:54:53,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:53,367 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 10:54:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:53,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:54:53,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784734234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:54:53,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:54:53,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 16 [2022-11-16 10:54:53,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915996341] [2022-11-16 10:54:53,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:54:53,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 10:54:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:53,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 10:54:53,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-11-16 10:54:53,601 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:53,871 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2022-11-16 10:54:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:54:53,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-11-16 10:54:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:53,872 INFO L225 Difference]: With dead ends: 155 [2022-11-16 10:54:53,872 INFO L226 Difference]: Without dead ends: 155 [2022-11-16 10:54:53,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-11-16 10:54:53,873 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 422 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:53,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 273 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:54:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-16 10:54:53,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 121. [2022-11-16 10:54:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 116 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 10:54:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2022-11-16 10:54:53,877 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 42 [2022-11-16 10:54:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:53,877 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2022-11-16 10:54:53,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:54:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2022-11-16 10:54:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 10:54:53,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:53,878 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2022-11-16 10:54:53,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 10:54:54,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 10:54:54,085 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:54,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash 790743329, now seen corresponding path program 1 times [2022-11-16 10:54:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:54,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902763254] [2022-11-16 10:54:54,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:54,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:54,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902763254] [2022-11-16 10:54:54,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902763254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:54,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710222420] [2022-11-16 10:54:54,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:54,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:54,359 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:54,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 10:54:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:54,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:54:54,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:54,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:54:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 10:54:54,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710222420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:54:54,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:54:54,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2022-11-16 10:54:54,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675195099] [2022-11-16 10:54:54,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:54:54,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:54:54,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:54,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:54:54,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:54:54,669 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 10:54:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:54,862 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2022-11-16 10:54:54,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:54:54,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-11-16 10:54:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:54,863 INFO L225 Difference]: With dead ends: 118 [2022-11-16 10:54:54,863 INFO L226 Difference]: Without dead ends: 118 [2022-11-16 10:54:54,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-16 10:54:54,864 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 234 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:54,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 418 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:54:54,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-16 10:54:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2022-11-16 10:54:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.297872340425532) internal successors, (122), 111 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 10:54:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2022-11-16 10:54:54,867 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 46 [2022-11-16 10:54:54,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:54,867 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2022-11-16 10:54:54,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 10:54:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2022-11-16 10:54:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 10:54:54,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:54,868 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:54:54,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 10:54:55,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:55,075 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1217170439, now seen corresponding path program 3 times [2022-11-16 10:54:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:55,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195022256] [2022-11-16 10:54:55,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:55,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:55,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:55,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 10:54:55,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:55,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195022256] [2022-11-16 10:54:55,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195022256] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:55,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766846412] [2022-11-16 10:54:55,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:54:55,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:55,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:55,300 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:55,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 10:54:55,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 10:54:55,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:54:55,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 10:54:55,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 10:54:55,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:54:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 10:54:55,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766846412] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:54:55,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:54:55,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-11-16 10:54:55,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063909789] [2022-11-16 10:54:55,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:54:55,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 10:54:55,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:54:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 10:54:55,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-16 10:54:55,856 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 10:54:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:54:56,038 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-11-16 10:54:56,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:54:56,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-11-16 10:54:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:54:56,040 INFO L225 Difference]: With dead ends: 113 [2022-11-16 10:54:56,040 INFO L226 Difference]: Without dead ends: 113 [2022-11-16 10:54:56,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-16 10:54:56,040 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 136 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:54:56,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 383 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:54:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-16 10:54:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-11-16 10:54:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 10:54:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-11-16 10:54:56,044 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 46 [2022-11-16 10:54:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:54:56,044 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-11-16 10:54:56,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 10:54:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-11-16 10:54:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 10:54:56,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:54:56,046 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2022-11-16 10:54:56,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 10:54:56,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:56,253 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:54:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:54:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash -399124699, now seen corresponding path program 1 times [2022-11-16 10:54:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:54:56,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627080289] [2022-11-16 10:54:56,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:56,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:54:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:57,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:54:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:57,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:54:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:54:57,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:54:57,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627080289] [2022-11-16 10:54:57,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627080289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:54:57,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756473470] [2022-11-16 10:54:57,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:54:57,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:54:57,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:54:57,978 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:54:57,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 10:54:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:54:58,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-16 10:54:58,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:58,248 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 10:54:58,461 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:54:58,461 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 10:54:58,555 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 10:54:58,676 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:54:58,676 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 10:54:58,927 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 0 case distinctions, treesize of input 22 treesize of output 21 [2022-11-16 10:54:58,937 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 13 treesize of output 9 [2022-11-16 10:54:59,119 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 10:54:59,265 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 16 treesize of output 18 [2022-11-16 10:54:59,469 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 19 treesize of output 7 [2022-11-16 10:54:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:54:59,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:00,337 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1833 (Array Int Int))) (<= (select (select (store |c_#memory_int| .cse0 v_ArrVal_1833) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1833 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_1833) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2022-11-16 10:55:00,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:00,520 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 36 treesize of output 37 [2022-11-16 10:55:00,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:00,532 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 64 treesize of output 63 [2022-11-16 10:55:00,539 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 25 treesize of output 21 [2022-11-16 10:55:00,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:00,574 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 36 treesize of output 37 [2022-11-16 10:55:00,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:00,580 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2022-11-16 10:55:00,586 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 25 treesize of output 21 [2022-11-16 10:55:00,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1828) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2022-11-16 10:55:00,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1828) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-11-16 10:55:00,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:00,901 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 10:55:00,904 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 10:55:00,910 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 10:55:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 10:55:01,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756473470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:55:01,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:55:01,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 27] total 72 [2022-11-16 10:55:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913007610] [2022-11-16 10:55:01,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:01,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 10:55:01,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:01,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 10:55:01,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4404, Unknown=67, NotChecked=408, Total=5112 [2022-11-16 10:55:01,459 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 72 states, 71 states have (on average 1.676056338028169) internal successors, (119), 63 states have internal predecessors, (119), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 10:55:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:04,335 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-11-16 10:55:04,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 10:55:04,336 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.676056338028169) internal successors, (119), 63 states have internal predecessors, (119), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-11-16 10:55:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:04,337 INFO L225 Difference]: With dead ends: 172 [2022-11-16 10:55:04,337 INFO L226 Difference]: Without dead ends: 172 [2022-11-16 10:55:04,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=556, Invalid=7395, Unknown=71, NotChecked=534, Total=8556 [2022-11-16 10:55:04,340 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 368 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 567 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:04,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 2357 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1310 Invalid, 0 Unknown, 567 Unchecked, 0.9s Time] [2022-11-16 10:55:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-16 10:55:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 125. [2022-11-16 10:55:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 10:55:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2022-11-16 10:55:04,346 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 49 [2022-11-16 10:55:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:04,346 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2022-11-16 10:55:04,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.676056338028169) internal successors, (119), 63 states have internal predecessors, (119), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 10:55:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2022-11-16 10:55:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 10:55:04,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:04,348 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-11-16 10:55:04,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-16 10:55:04,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-16 10:55:04,554 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:04,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash -656821325, now seen corresponding path program 4 times [2022-11-16 10:55:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:04,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733987269] [2022-11-16 10:55:04,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:04,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:04,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 10:55:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-16 10:55:04,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:04,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733987269] [2022-11-16 10:55:04,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733987269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:04,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464217368] [2022-11-16 10:55:04,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 10:55:04,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:04,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:04,703 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:04,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 10:55:04,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 10:55:04,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:55:04,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:55:04,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 10:55:05,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:55:05,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464217368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:05,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 10:55:05,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-16 10:55:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568419112] [2022-11-16 10:55:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:05,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:55:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:55:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:55:05,022 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 10:55:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:05,034 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-11-16 10:55:05,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:55:05,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-11-16 10:55:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:05,036 INFO L225 Difference]: With dead ends: 87 [2022-11-16 10:55:05,036 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 10:55:05,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:55:05,037 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 116 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:05,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 84 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 10:55:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 10:55:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-16 10:55:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 83 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-11-16 10:55:05,041 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 50 [2022-11-16 10:55:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:05,042 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-11-16 10:55:05,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 10:55:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-11-16 10:55:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 10:55:05,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:05,043 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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 10:55:05,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:05,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 10:55:05,249 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash 780049028, now seen corresponding path program 1 times [2022-11-16 10:55:05,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:05,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121024342] [2022-11-16 10:55:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:05,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:05,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-16 10:55:05,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:05,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121024342] [2022-11-16 10:55:05,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121024342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:05,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745761767] [2022-11-16 10:55:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:05,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:05,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:05,383 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:05,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 10:55:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:05,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 10:55:05,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-16 10:55:05,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-16 10:55:05,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745761767] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:55:05,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:55:05,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2022-11-16 10:55:05,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479986102] [2022-11-16 10:55:05,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:05,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:55:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:05,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:55:05,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:55:05,728 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:05,831 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-11-16 10:55:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:55:05,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-11-16 10:55:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:05,832 INFO L225 Difference]: With dead ends: 84 [2022-11-16 10:55:05,833 INFO L226 Difference]: Without dead ends: 84 [2022-11-16 10:55:05,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:55:05,833 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 73 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:05,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 327 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:55:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-16 10:55:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-16 10:55:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2022-11-16 10:55:05,838 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 55 [2022-11-16 10:55:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:05,839 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2022-11-16 10:55:05,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2022-11-16 10:55:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 10:55:05,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:05,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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 10:55:05,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:06,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 10:55:06,046 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:06,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:06,047 INFO L85 PathProgramCache]: Analyzing trace with hash 780048973, now seen corresponding path program 1 times [2022-11-16 10:55:06,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:06,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234961287] [2022-11-16 10:55:06,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:06,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:07,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 10:55:07,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:07,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234961287] [2022-11-16 10:55:07,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234961287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:07,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125738313] [2022-11-16 10:55:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:07,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:07,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:07,226 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:07,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 10:55:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:07,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-16 10:55:07,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:07,499 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 10:55:07,584 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:55:07,584 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 10:55:07,608 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 10:55:07,674 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:07,675 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 10:55:07,863 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 10:55:07,863 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 22 treesize of output 27 [2022-11-16 10:55:08,134 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:08,134 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 28 treesize of output 29 [2022-11-16 10:55:08,318 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 10:55:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:55:08,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:08,375 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-16 10:55:08,376 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 19 treesize of output 18 [2022-11-16 10:55:08,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2279 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2279) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) is different from false [2022-11-16 10:55:08,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~s~0#1.offset_16| Int) (v_ArrVal_2277 Int) (v_ArrVal_2279 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2277))) (let ((.cse0 (select .cse1 |v_ULTIMATE.start_main_~s~0#1.offset_16|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1) .cse0 v_ArrVal_2279) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_16|)))) (not (<= |v_ULTIMATE.start_main_~s~0#1.offset_16| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~s~0#1.offset_16|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |v_ULTIMATE.start_main_~s~0#1.offset_16|))) is different from false [2022-11-16 10:55:08,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~s~0#1.offset_16| Int) (v_ArrVal_2277 Int) (v_ArrVal_2279 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2277))) (let ((.cse0 (select .cse1 |v_ULTIMATE.start_main_~s~0#1.offset_16|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2279) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_16|)))) (not (<= 0 |v_ULTIMATE.start_main_~s~0#1.offset_16|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |v_ULTIMATE.start_main_~s~0#1.offset_16|) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_16|))) is different from false [2022-11-16 10:55:08,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~s~0#1.offset_16| Int) (v_ArrVal_2277 Int) (v_ArrVal_2279 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2276))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2277))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_main_~s~0#1.offset_16|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_2279) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_16|) .cse2)))) (not (<= 0 |v_ULTIMATE.start_main_~s~0#1.offset_16|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |v_ULTIMATE.start_main_~s~0#1.offset_16|) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_16|))) is different from false [2022-11-16 10:55:08,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~s~0#1.offset_16| Int) (v_ArrVal_2277 Int) (v_ArrVal_2279 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| Int)) (or (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_16|) (not (<= 0 |v_ULTIMATE.start_main_~s~0#1.offset_16|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| |v_ULTIMATE.start_main_~s~0#1.offset_16|) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2276))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_31| 4) v_ArrVal_2277))) (let ((.cse2 (select .cse1 |v_ULTIMATE.start_main_~s~0#1.offset_16|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_2279) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |v_ULTIMATE.start_main_~s~0#1.offset_16|) .cse2)))))) is different from false [2022-11-16 10:55:08,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:08,930 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 82 treesize of output 59 [2022-11-16 10:55:08,937 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 94 treesize of output 86 [2022-11-16 10:55:08,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:08,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:08,951 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 26 treesize of output 28 [2022-11-16 10:55:08,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:08,961 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 18 treesize of output 14 [2022-11-16 10:55:08,967 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 30 treesize of output 26 [2022-11-16 10:55:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-16 10:55:09,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125738313] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:55:09,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:55:09,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 54 [2022-11-16 10:55:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611764077] [2022-11-16 10:55:09,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:09,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-16 10:55:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:09,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-16 10:55:09,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2270, Unknown=26, NotChecked=500, Total=2970 [2022-11-16 10:55:09,853 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 55 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 48 states have internal predecessors, (117), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 10:55:12,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:12,185 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2022-11-16 10:55:12,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 10:55:12,191 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 48 states have internal predecessors, (117), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2022-11-16 10:55:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:12,192 INFO L225 Difference]: With dead ends: 136 [2022-11-16 10:55:12,192 INFO L226 Difference]: Without dead ends: 136 [2022-11-16 10:55:12,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=457, Invalid=4093, Unknown=26, NotChecked=680, Total=5256 [2022-11-16 10:55:12,195 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 755 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 806 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:12,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1146 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 745 Invalid, 0 Unknown, 806 Unchecked, 0.5s Time] [2022-11-16 10:55:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-16 10:55:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 83. [2022-11-16 10:55:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 79 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-11-16 10:55:12,201 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 55 [2022-11-16 10:55:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:12,201 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-11-16 10:55:12,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 48 states have internal predecessors, (117), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 10:55:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-11-16 10:55:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 10:55:12,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:12,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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 10:55:12,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:12,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:12,411 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:12,411 INFO L85 PathProgramCache]: Analyzing trace with hash 780048974, now seen corresponding path program 1 times [2022-11-16 10:55:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:12,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903769849] [2022-11-16 10:55:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 10:55:14,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:14,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903769849] [2022-11-16 10:55:14,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903769849] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:14,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050441616] [2022-11-16 10:55:14,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:14,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:14,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:14,379 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:14,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 10:55:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:14,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-16 10:55:14,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:14,675 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 10:55:15,000 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:55:15,000 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 10:55:15,108 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 10:55:15,235 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:15,235 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 10:55:15,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:15,490 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 22 treesize of output 21 [2022-11-16 10:55:15,745 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:15,746 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 44 treesize of output 43 [2022-11-16 10:55:15,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:15,751 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 35 treesize of output 35 [2022-11-16 10:55:16,030 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 31 treesize of output 19 [2022-11-16 10:55:16,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-16 10:55:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 10:55:16,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:16,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:16,425 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 43 treesize of output 47 [2022-11-16 10:55:16,752 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:16,753 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 106 treesize of output 97 [2022-11-16 10:55:16,760 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 79 treesize of output 77 [2022-11-16 10:55:16,777 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 77 treesize of output 75 [2022-11-16 10:55:17,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2416 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2416) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2022-11-16 10:55:17,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2416 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2416) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-11-16 10:55:17,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:17,307 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 10:55:17,310 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 10:55:17,313 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 10:55:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-11-16 10:55:17,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050441616] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:55:17,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:55:17,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 67 [2022-11-16 10:55:17,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724321566] [2022-11-16 10:55:17,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:17,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-16 10:55:17,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-16 10:55:17,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=4072, Unknown=2, NotChecked=258, Total=4556 [2022-11-16 10:55:18,000 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 68 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 59 states have internal predecessors, (146), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 10:55:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:20,629 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2022-11-16 10:55:20,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 10:55:20,630 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 59 states have internal predecessors, (146), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2022-11-16 10:55:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:20,630 INFO L225 Difference]: With dead ends: 115 [2022-11-16 10:55:20,631 INFO L226 Difference]: Without dead ends: 115 [2022-11-16 10:55:20,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=464, Invalid=5704, Unknown=2, NotChecked=310, Total=6480 [2022-11-16 10:55:20,634 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 761 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:20,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 2435 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1423 Invalid, 0 Unknown, 318 Unchecked, 0.9s Time] [2022-11-16 10:55:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-16 10:55:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2022-11-16 10:55:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 77 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-11-16 10:55:20,638 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 55 [2022-11-16 10:55:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:20,638 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-11-16 10:55:20,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 2.1791044776119404) internal successors, (146), 59 states have internal predecessors, (146), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 10:55:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-11-16 10:55:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-16 10:55:20,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:20,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-16 10:55:20,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:20,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 10:55:20,846 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:20,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1638855954, now seen corresponding path program 1 times [2022-11-16 10:55:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:20,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410935733] [2022-11-16 10:55:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-16 10:55:20,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:20,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410935733] [2022-11-16 10:55:20,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410935733] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:20,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988669593] [2022-11-16 10:55:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:20,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:20,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:20,969 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:21,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 10:55:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:21,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:55:21,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-16 10:55:21,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-16 10:55:21,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988669593] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:55:21,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:55:21,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-11-16 10:55:21,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846490805] [2022-11-16 10:55:21,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:21,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:55:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:55:21,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:55:21,352 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:21,448 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-11-16 10:55:21,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:55:21,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2022-11-16 10:55:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:21,449 INFO L225 Difference]: With dead ends: 81 [2022-11-16 10:55:21,449 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 10:55:21,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:55:21,450 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 98 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:21,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 249 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:55:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 10:55:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-16 10:55:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.196969696969697) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-11-16 10:55:21,453 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 56 [2022-11-16 10:55:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:21,453 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-11-16 10:55:21,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:21,454 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-11-16 10:55:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 10:55:21,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:21,454 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-16 10:55:21,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:21,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 10:55:21,655 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1039883103, now seen corresponding path program 1 times [2022-11-16 10:55:21,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:21,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501634676] [2022-11-16 10:55:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:55:24,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:24,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501634676] [2022-11-16 10:55:24,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501634676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:24,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494050700] [2022-11-16 10:55:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:24,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:24,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:24,128 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:24,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 10:55:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:24,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-16 10:55:24,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:24,518 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 10:55:24,823 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:55:24,823 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 10:55:24,943 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 10:55:25,112 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:25,112 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 10:55:25,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:25,443 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 22 treesize of output 21 [2022-11-16 10:55:25,908 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:25,908 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 56 treesize of output 53 [2022-11-16 10:55:25,915 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 27 treesize of output 19 [2022-11-16 10:55:25,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:25,919 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 30 treesize of output 32 [2022-11-16 10:55:26,394 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 50 treesize of output 34 [2022-11-16 10:55:26,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-11-16 10:55:26,539 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 28 treesize of output 10 [2022-11-16 10:55:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:55:26,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:27,352 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 76 treesize of output 56 [2022-11-16 10:55:27,365 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 76 treesize of output 56 [2022-11-16 10:55:27,380 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_2693 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2693) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse0 |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (<= |c_ULTIMATE.start_sll_circular_update_at_~data#1| .cse0) (forall ((v_ArrVal_2695 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2695) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-16 10:55:27,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:27,667 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 38 treesize of output 37 [2022-11-16 10:55:27,672 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 13 treesize of output 11 [2022-11-16 10:55:28,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2689 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2689) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2022-11-16 10:55:28,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2689 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2689) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) is different from false [2022-11-16 10:55:28,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:28,393 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 10:55:28,396 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 10:55:28,400 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 10:55:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-16 10:55:29,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494050700] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:55:29,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:55:29,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 30] total 85 [2022-11-16 10:55:29,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976002160] [2022-11-16 10:55:29,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:29,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-16 10:55:29,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:29,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-16 10:55:29,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=6365, Unknown=41, NotChecked=486, Total=7140 [2022-11-16 10:55:29,200 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 85 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 76 states have internal predecessors, (152), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 10:55:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:33,694 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-11-16 10:55:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 10:55:33,694 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 76 states have internal predecessors, (152), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 59 [2022-11-16 10:55:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:33,695 INFO L225 Difference]: With dead ends: 79 [2022-11-16 10:55:33,695 INFO L226 Difference]: Without dead ends: 79 [2022-11-16 10:55:33,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2170 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=663, Invalid=10860, Unknown=45, NotChecked=642, Total=12210 [2022-11-16 10:55:33,699 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 403 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:33,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 2083 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1934 Invalid, 0 Unknown, 312 Unchecked, 1.2s Time] [2022-11-16 10:55:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-16 10:55:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-16 10:55:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 75 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-11-16 10:55:33,702 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 59 [2022-11-16 10:55:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:33,703 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-11-16 10:55:33,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 76 states have internal predecessors, (152), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 10:55:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-11-16 10:55:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 10:55:33,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:33,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-16 10:55:33,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:33,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 10:55:33,910 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -786361131, now seen corresponding path program 1 times [2022-11-16 10:55:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:33,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819501908] [2022-11-16 10:55:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:33,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 10:55:34,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:34,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819501908] [2022-11-16 10:55:34,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819501908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:34,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:34,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 10:55:34,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152299973] [2022-11-16 10:55:34,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:34,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:55:34,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:34,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:55:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:55:34,142 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:34,396 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2022-11-16 10:55:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:55:34,397 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-11-16 10:55:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:34,397 INFO L225 Difference]: With dead ends: 97 [2022-11-16 10:55:34,398 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 10:55:34,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-16 10:55:34,398 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 187 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:34,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 258 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:55:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 10:55:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2022-11-16 10:55:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 78 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-16 10:55:34,401 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 63 [2022-11-16 10:55:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:34,402 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-16 10:55:34,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-16 10:55:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 10:55:34,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:34,403 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-16 10:55:34,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-16 10:55:34,403 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:34,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash -786361130, now seen corresponding path program 1 times [2022-11-16 10:55:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:34,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447831068] [2022-11-16 10:55:34,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:34,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 10:55:34,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:34,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447831068] [2022-11-16 10:55:34,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447831068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:34,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:34,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 10:55:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959602949] [2022-11-16 10:55:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:34,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:55:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:34,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:55:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:55:34,767 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:35,019 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-11-16 10:55:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:55:35,019 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-11-16 10:55:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:35,020 INFO L225 Difference]: With dead ends: 80 [2022-11-16 10:55:35,020 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 10:55:35,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-16 10:55:35,021 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 191 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:35,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 201 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:55:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 10:55:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-16 10:55:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-16 10:55:35,024 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 63 [2022-11-16 10:55:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:35,025 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-16 10:55:35,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-16 10:55:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-16 10:55:35,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:35,026 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-16 10:55:35,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 10:55:35,026 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1392642591, now seen corresponding path program 1 times [2022-11-16 10:55:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:35,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339933547] [2022-11-16 10:55:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:35,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 10:55:35,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:35,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339933547] [2022-11-16 10:55:35,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339933547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:35,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:35,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 10:55:35,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009212915] [2022-11-16 10:55:35,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:35,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:55:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:35,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:55:35,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:55:35,211 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:35,365 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-16 10:55:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:55:35,366 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2022-11-16 10:55:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:35,367 INFO L225 Difference]: With dead ends: 80 [2022-11-16 10:55:35,367 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 10:55:35,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-16 10:55:35,368 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 187 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:35,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 257 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:55:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 10:55:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-16 10:55:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.144927536231884) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-11-16 10:55:35,371 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 64 [2022-11-16 10:55:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:35,372 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-11-16 10:55:35,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-11-16 10:55:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 10:55:35,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:35,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2022-11-16 10:55:35,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-16 10:55:35,373 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:35,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:35,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1732740515, now seen corresponding path program 1 times [2022-11-16 10:55:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:35,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202917168] [2022-11-16 10:55:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 10:55:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:35,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202917168] [2022-11-16 10:55:35,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202917168] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:35,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964977855] [2022-11-16 10:55:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:35,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:35,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:35,633 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:35,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 10:55:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:35,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 10:55:35,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:36,244 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 10:55:36,249 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 10:55:36,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:36,338 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-16 10:55:36,338 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 16 treesize of output 15 [2022-11-16 10:55:36,409 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 10:55:36,409 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 11 treesize of output 11 [2022-11-16 10:55:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-16 10:55:36,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964977855] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:55:36,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:55:36,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2022-11-16 10:55:36,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201964961] [2022-11-16 10:55:36,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:36,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 10:55:36,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:36,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 10:55:36,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-11-16 10:55:36,482 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 27 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 10:55:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:37,099 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-11-16 10:55:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 10:55:37,101 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2022-11-16 10:55:37,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:37,102 INFO L225 Difference]: With dead ends: 88 [2022-11-16 10:55:37,102 INFO L226 Difference]: Without dead ends: 88 [2022-11-16 10:55:37,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 10:55:37,103 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 413 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:37,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 574 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:55:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-16 10:55:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-11-16 10:55:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-16 10:55:37,106 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 66 [2022-11-16 10:55:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:37,106 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-16 10:55:37,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.230769230769231) internal successors, (110), 25 states have internal predecessors, (110), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 10:55:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-16 10:55:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-16 10:55:37,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:37,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2022-11-16 10:55:37,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:37,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-16 10:55:37,315 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:37,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:37,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1732740514, now seen corresponding path program 1 times [2022-11-16 10:55:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:37,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625106075] [2022-11-16 10:55:37,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:37,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:38,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 10:55:38,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:38,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625106075] [2022-11-16 10:55:38,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625106075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:38,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918926116] [2022-11-16 10:55:38,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:38,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:38,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:38,855 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:38,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 10:55:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:39,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-16 10:55:39,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:39,205 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 10:55:39,446 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:55:39,446 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 10:55:39,552 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 10:55:39,557 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 10:55:39,683 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:39,684 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 29 treesize of output 30 [2022-11-16 10:55:39,690 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 18 treesize of output 20 [2022-11-16 10:55:39,959 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 10:55:39,959 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 22 treesize of output 27 [2022-11-16 10:55:39,982 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 10:55:39,982 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 1 case distinctions, treesize of input 21 treesize of output 26 [2022-11-16 10:55:40,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:40,208 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 30 treesize of output 30 [2022-11-16 10:55:40,407 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 10:55:40,407 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 37 treesize of output 41 [2022-11-16 10:55:41,024 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 10:55:41,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:41,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:41,031 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 31 treesize of output 22 [2022-11-16 10:55:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 10:55:41,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:41,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:41,476 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 32 treesize of output 36 [2022-11-16 10:55:41,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:41,677 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 28 treesize of output 32 [2022-11-16 10:55:44,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:44,069 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 62 treesize of output 63 [2022-11-16 10:55:44,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:44,077 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 54 treesize of output 47 [2022-11-16 10:55:44,092 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 86 treesize of output 82 [2022-11-16 10:55:44,102 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 198 treesize of output 192 [2022-11-16 10:55:44,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:44,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:44,119 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 80 treesize of output 78 [2022-11-16 10:55:44,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:44,131 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 72 treesize of output 64 [2022-11-16 10:55:44,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:44,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:44,173 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 126 treesize of output 128 [2022-11-16 10:55:44,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:44,183 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 106 treesize of output 102 [2022-11-16 10:55:44,193 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 102 treesize of output 94 [2022-11-16 10:55:44,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918926116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:44,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:55:44,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 54 [2022-11-16 10:55:44,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539991619] [2022-11-16 10:55:44,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:44,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-16 10:55:44,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:44,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-16 10:55:44,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5278, Unknown=151, NotChecked=0, Total=5700 [2022-11-16 10:55:44,723 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 55 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 49 states have internal predecessors, (117), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 10:55:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:47,771 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-11-16 10:55:47,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 10:55:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 49 states have internal predecessors, (117), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 66 [2022-11-16 10:55:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:47,775 INFO L225 Difference]: With dead ends: 89 [2022-11-16 10:55:47,776 INFO L226 Difference]: Without dead ends: 89 [2022-11-16 10:55:47,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=633, Invalid=7772, Unknown=151, NotChecked=0, Total=8556 [2022-11-16 10:55:47,777 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 537 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:47,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 1070 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 10:55:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-16 10:55:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2022-11-16 10:55:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.125) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-11-16 10:55:47,785 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 66 [2022-11-16 10:55:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:47,785 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-11-16 10:55:47,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.1666666666666665) internal successors, (117), 49 states have internal predecessors, (117), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 10:55:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-11-16 10:55:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-16 10:55:47,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:47,786 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-11-16 10:55:47,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:47,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:47,987 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2119617500, now seen corresponding path program 1 times [2022-11-16 10:55:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:47,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717597389] [2022-11-16 10:55:47,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:48,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-16 10:55:48,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:48,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717597389] [2022-11-16 10:55:48,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717597389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:55:48,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:55:48,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 10:55:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443246894] [2022-11-16 10:55:48,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:55:48,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 10:55:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:48,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 10:55:48,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:55:48,235 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:48,447 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-11-16 10:55:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 10:55:48,447 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-11-16 10:55:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:48,448 INFO L225 Difference]: With dead ends: 81 [2022-11-16 10:55:48,448 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 10:55:48,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-16 10:55:48,449 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 172 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:48,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 222 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:55:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 10:55:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-16 10:55:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-11-16 10:55:48,457 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 67 [2022-11-16 10:55:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:48,458 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-11-16 10:55:48,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 10:55:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-11-16 10:55:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-16 10:55:48,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:48,461 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-11-16 10:55:48,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-16 10:55:48,461 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1139341665, now seen corresponding path program 1 times [2022-11-16 10:55:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:48,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037315209] [2022-11-16 10:55:48,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:48,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:49,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 10:55:49,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:49,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037315209] [2022-11-16 10:55:49,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037315209] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:49,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130272661] [2022-11-16 10:55:49,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:49,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:49,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:49,860 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:49,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 10:55:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:50,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-16 10:55:50,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:50,187 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 10:55:50,301 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 5 treesize of output 3 [2022-11-16 10:55:50,375 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:55:50,376 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 10:55:50,475 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 10:55:50,608 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:50,609 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 28 treesize of output 29 [2022-11-16 10:55:50,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:50,726 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 31 treesize of output 26 [2022-11-16 10:55:50,973 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:50,973 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 28 treesize of output 29 [2022-11-16 10:55:51,303 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 10:55:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 10:55:51,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:51,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3431 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3431) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-16 10:55:52,013 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3428 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3428) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3428 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3428) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-11-16 10:55:52,037 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3428 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3428) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_3428 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3428) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-11-16 10:55:52,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:52,046 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 20 treesize of output 21 [2022-11-16 10:55:52,049 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 34 treesize of output 26 [2022-11-16 10:55:52,054 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 7 treesize of output 5 [2022-11-16 10:55:52,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:52,063 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 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-16 10:55:52,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:52,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 10:55:52,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130272661] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:52,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:55:52,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 40 [2022-11-16 10:55:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319937282] [2022-11-16 10:55:52,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-16 10:55:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-16 10:55:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2192, Unknown=3, NotChecked=288, Total=2652 [2022-11-16 10:55:52,295 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 41 states, 40 states have (on average 2.525) internal successors, (101), 36 states have internal predecessors, (101), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 10:55:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:53,785 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2022-11-16 10:55:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 10:55:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.525) internal successors, (101), 36 states have internal predecessors, (101), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 69 [2022-11-16 10:55:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:53,786 INFO L225 Difference]: With dead ends: 86 [2022-11-16 10:55:53,786 INFO L226 Difference]: Without dead ends: 86 [2022-11-16 10:55:53,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=361, Invalid=3680, Unknown=3, NotChecked=378, Total=4422 [2022-11-16 10:55:53,788 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 360 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:53,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 616 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 10:55:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-16 10:55:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-11-16 10:55:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.095890410958904) internal successors, (80), 78 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2022-11-16 10:55:53,791 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 69 [2022-11-16 10:55:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:53,792 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2022-11-16 10:55:53,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.525) internal successors, (101), 36 states have internal predecessors, (101), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 10:55:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-11-16 10:55:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-16 10:55:53,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:53,793 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-11-16 10:55:53,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-16 10:55:53,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-16 10:55:54,000 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:54,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:54,000 INFO L85 PathProgramCache]: Analyzing trace with hash 915924659, now seen corresponding path program 1 times [2022-11-16 10:55:54,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:54,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871363441] [2022-11-16 10:55:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:54,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:55:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:54,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:55:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:55,040 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 10:55:55,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:55:55,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871363441] [2022-11-16 10:55:55,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871363441] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:55:55,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568927498] [2022-11-16 10:55:55,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:55,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:55:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:55:55,042 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:55:55,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 10:55:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:55:55,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-16 10:55:55,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:55:55,364 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 10:55:55,466 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:55:55,466 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 10:55:55,541 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 10:55:55,641 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:55,641 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 10:55:55,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:55:55,730 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 22 treesize of output 21 [2022-11-16 10:55:55,908 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:55:55,909 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 10:55:56,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:56,018 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 16 treesize of output 16 [2022-11-16 10:55:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 10:55:56,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:55:56,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3572 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3572) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-11-16 10:55:56,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3572 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3572) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2022-11-16 10:55:56,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3570 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_3570)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3572)) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2022-11-16 10:55:56,563 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3570 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4) v_ArrVal_3570))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3572)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2022-11-16 10:55:56,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3570 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4) v_ArrVal_3570))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3572)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base|)))) is different from false [2022-11-16 10:55:56,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3570 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4) v_ArrVal_3570))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3572)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))))) is different from false [2022-11-16 10:55:56,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3569 (Array Int Int)) (v_ArrVal_3570 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3569))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4) v_ArrVal_3570))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3572))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))))) is different from false [2022-11-16 10:55:56,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_3572 (Array Int Int)) (v_ArrVal_3569 (Array Int Int)) (v_ArrVal_3570 Int)) (or (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3569))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4) v_ArrVal_3570))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3572))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-16 10:55:56,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:56,634 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 63 treesize of output 48 [2022-11-16 10:55:56,638 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 107 treesize of output 99 [2022-11-16 10:55:56,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:56,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:56,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:56,653 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 77 treesize of output 80 [2022-11-16 10:55:56,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:56,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:55:56,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:55:56,666 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 63 treesize of output 63 [2022-11-16 10:55:56,672 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 50 treesize of output 46 [2022-11-16 10:55:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2022-11-16 10:55:57,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568927498] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:55:57,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:55:57,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 61 [2022-11-16 10:55:57,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442345276] [2022-11-16 10:55:57,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:55:57,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-16 10:55:57,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:55:57,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-16 10:55:57,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2582, Unknown=40, NotChecked=872, Total=3660 [2022-11-16 10:55:57,410 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 61 states, 61 states have (on average 2.2295081967213113) internal successors, (136), 53 states have internal predecessors, (136), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-16 10:55:59,095 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (not (= (select .cse0 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_3572 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3572) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2022-11-16 10:55:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:55:59,467 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-11-16 10:55:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 10:55:59,468 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.2295081967213113) internal successors, (136), 53 states have internal predecessors, (136), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 70 [2022-11-16 10:55:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:55:59,469 INFO L225 Difference]: With dead ends: 80 [2022-11-16 10:55:59,469 INFO L226 Difference]: Without dead ends: 80 [2022-11-16 10:55:59,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=339, Invalid=4345, Unknown=44, NotChecked=1278, Total=6006 [2022-11-16 10:55:59,470 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 185 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 657 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:55:59,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 979 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 932 Invalid, 0 Unknown, 657 Unchecked, 0.5s Time] [2022-11-16 10:55:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-16 10:55:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-11-16 10:55:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 75 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:55:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-11-16 10:55:59,473 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 70 [2022-11-16 10:55:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:55:59,473 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-11-16 10:55:59,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.2295081967213113) internal successors, (136), 53 states have internal predecessors, (136), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-16 10:55:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-11-16 10:55:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-16 10:55:59,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:55:59,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-11-16 10:55:59,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-16 10:55:59,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-16 10:55:59,681 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:55:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:55:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash -998839710, now seen corresponding path program 1 times [2022-11-16 10:55:59,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:55:59,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955726759] [2022-11-16 10:55:59,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:55:59,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:55:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:01,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:56:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:01,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:56:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 10:56:01,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:01,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955726759] [2022-11-16 10:56:01,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955726759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:56:01,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509526553] [2022-11-16 10:56:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:01,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:56:01,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:56:01,884 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:56:01,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 10:56:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:02,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-16 10:56:02,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:02,211 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 10:56:02,479 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 10:56:02,479 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 10:56:02,596 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 10:56:02,603 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 10:56:02,768 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-16 10:56:02,769 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 55 treesize of output 41 [2022-11-16 10:56:02,773 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 46 treesize of output 36 [2022-11-16 10:56:03,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:56:03,156 INFO L321 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2022-11-16 10:56:03,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 49 [2022-11-16 10:56:03,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:56:03,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2022-11-16 10:56:03,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:56:03,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:56:03,537 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 10:56:03,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 65 [2022-11-16 10:56:03,558 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-11-16 10:56:03,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 66 treesize of output 55 [2022-11-16 10:56:04,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:56:04,212 INFO L321 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2022-11-16 10:56:04,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 38 [2022-11-16 10:56:04,223 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 10:56:04,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2022-11-16 10:56:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 10:56:04,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:54,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:56:54,273 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-16 10:56:54,274 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 2 case distinctions, treesize of input 4268 treesize of output 4260 [2022-11-16 10:56:54,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:56:54,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:56:55,403 INFO L321 Elim1Store]: treesize reduction 571, result has 35.1 percent of original size [2022-11-16 10:56:55,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 47 case distinctions, treesize of input 83898 treesize of output 42430 [2022-11-16 10:56:57,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:56:57,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35266 treesize of output 32522 [2022-11-16 10:56:57,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:56:57,550 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 29 treesize of output 31 [2022-11-16 10:56:57,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:56:57,792 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 12 treesize of output 8 [2022-11-16 10:56:57,906 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 10:56:58,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:56:58,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:56:58,137 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 27 treesize of output 29 [2022-11-16 10:57:16,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 10:57:16,568 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 10:57:16,568 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 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-16 10:57:16,818 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 10:57:16,970 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 10:57:16,971 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 15 treesize of output 14 [2022-11-16 10:57:17,444 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 10:57:17,595 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 5 treesize of output 3 [2022-11-16 10:57:17,648 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 10:57:17,648 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 18 treesize of output 17 [2022-11-16 10:57:17,851 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 5 treesize of output 3 [2022-11-16 10:57:18,001 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 63 treesize of output 57 [2022-11-16 10:57:18,051 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 55 treesize of output 51 [2022-11-16 10:57:18,191 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 10:57:18,191 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 81 treesize of output 76 [2022-11-16 10:57:18,276 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 10:57:18,276 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 61 treesize of output 58 [2022-11-16 10:57:18,488 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 10:57:18,550 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 10:57:18,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:57:18,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:18,588 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2022-11-16 10:57:18,617 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 10:57:18,637 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 10:57:18,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:18,660 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-16 10:57:18,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:18,818 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-16 10:57:18,839 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 10:57:19,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:57:19,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:57:19,806 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 171 treesize of output 179 [2022-11-16 10:57:20,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:57:20,458 INFO L321 Elim1Store]: treesize reduction 4959, result has 0.0 percent of original size [2022-11-16 10:57:20,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 520852 treesize of output 1 [2022-11-16 10:57:21,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509526553] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:21,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:57:21,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 53 [2022-11-16 10:57:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963253063] [2022-11-16 10:57:21,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:57:21,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-16 10:57:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:57:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-16 10:57:21,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=4824, Unknown=10, NotChecked=0, Total=5112 [2022-11-16 10:57:21,673 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 47 states have internal predecessors, (113), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 10:57:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:27,242 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-11-16 10:57:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 10:57:27,242 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 47 states have internal predecessors, (113), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2022-11-16 10:57:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:27,243 INFO L225 Difference]: With dead ends: 71 [2022-11-16 10:57:27,243 INFO L226 Difference]: Without dead ends: 71 [2022-11-16 10:57:27,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 56.2s TimeCoverageRelationStatistics Valid=730, Invalid=7092, Unknown=10, NotChecked=0, Total=7832 [2022-11-16 10:57:27,245 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 609 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:27,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 768 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 10:57:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-16 10:57:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-16 10:57:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 67 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:57:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-11-16 10:57:27,248 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 72 [2022-11-16 10:57:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:27,248 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-11-16 10:57:27,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 47 states have internal predecessors, (113), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 10:57:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-11-16 10:57:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 10:57:27,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:27,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:27,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:27,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:57:27,459 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:57:27,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2107297006, now seen corresponding path program 1 times [2022-11-16 10:57:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:57:27,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415080920] [2022-11-16 10:57:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:57:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:57:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:57:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:29,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:57:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 10:57:29,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:57:29,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415080920] [2022-11-16 10:57:29,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415080920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:29,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126826985] [2022-11-16 10:57:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:57:29,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:57:29,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:57:29,587 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:57:29,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 10:57:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:30,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 10:57:30,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:30,369 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 10:57:30,370 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 18 [2022-11-16 10:57:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-16 10:57:30,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-16 10:57:30,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126826985] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:57:30,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 10:57:30,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 7, 7] total 38 [2022-11-16 10:57:30,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478216782] [2022-11-16 10:57:30,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 10:57:30,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 10:57:30,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:57:30,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 10:57:30,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 10:57:30,935 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 39 states, 38 states have (on average 3.210526315789474) internal successors, (122), 36 states have internal predecessors, (122), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 10:57:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:33,104 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-11-16 10:57:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 10:57:33,105 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.210526315789474) internal successors, (122), 36 states have internal predecessors, (122), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 74 [2022-11-16 10:57:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:33,106 INFO L225 Difference]: With dead ends: 70 [2022-11-16 10:57:33,106 INFO L226 Difference]: Without dead ends: 70 [2022-11-16 10:57:33,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=342, Invalid=2738, Unknown=0, NotChecked=0, Total=3080 [2022-11-16 10:57:33,111 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 205 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:33,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 548 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 905 Invalid, 0 Unknown, 38 Unchecked, 0.8s Time] [2022-11-16 10:57:33,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-16 10:57:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-16 10:57:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.0) internal successors, (66), 66 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 10:57:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2022-11-16 10:57:33,116 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 74 [2022-11-16 10:57:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:33,117 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2022-11-16 10:57:33,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.210526315789474) internal successors, (122), 36 states have internal predecessors, (122), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 10:57:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-11-16 10:57:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-16 10:57:33,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:33,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:33,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:33,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-16 10:57:33,327 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-16 10:57:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2112146488, now seen corresponding path program 1 times [2022-11-16 10:57:33,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:57:33,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142567870] [2022-11-16 10:57:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:57:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:57:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:34,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 10:57:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 10:57:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 10:57:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:57:35,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142567870] [2022-11-16 10:57:35,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142567870] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 10:57:35,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192491703] [2022-11-16 10:57:35,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:57:35,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:57:35,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:57:35,237 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:57:35,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-16 10:57:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:35,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-16 10:57:35,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:35,889 INFO L321 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2022-11-16 10:57:35,889 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 3 case distinctions, treesize of input 25 treesize of output 39 [2022-11-16 10:57:36,072 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 10:57:36,311 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:57:36,311 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 58 treesize of output 53 [2022-11-16 10:57:36,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 10:57:36,781 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 61 treesize of output 44 [2022-11-16 10:57:37,195 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 10:57:37,195 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 58 treesize of output 53 [2022-11-16 10:57:37,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:57:37,755 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 55 treesize of output 39 [2022-11-16 10:57:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 10:57:39,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:57:39,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)) (= (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_sll_circular_destroy_~head#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-11-16 10:57:39,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)) (= (store (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-11-16 10:57:39,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4003 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_4003) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-16 10:57:39,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4003 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_4003) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0)))) is different from false [2022-11-16 10:57:39,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4003 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_4003) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-11-16 10:57:39,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4003 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int)) (or (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4003) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-16 10:57:39,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4003 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int) (v_ArrVal_4001 Int)) (or (= (store (store |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_4001)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4003)) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-16 10:57:39,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4003 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int) (v_ArrVal_4001 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (= (store (store |c_#valid| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| 4) v_ArrVal_4001))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4003)) |c_ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-16 10:57:39,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4003 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int) (v_ArrVal_4001 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| Int)) (or (= (store (store |c_#valid| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| 4) v_ArrVal_4001))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_4003)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_sll_circular_create_#res#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2022-11-16 10:57:39,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4003 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int) (v_ArrVal_4001 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| Int)) (or (= (store (store |c_#valid| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| 4) v_ArrVal_4001))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_4003)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-16 10:57:39,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_4003 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int) (v_ArrVal_4001 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (store (store |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_4000))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| 4) v_ArrVal_4001))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_4003))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-16 10:57:39,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_4003 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~head#1.offset| Int) (v_ArrVal_4001 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (<= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|)) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_4000))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_52| 4) v_ArrVal_4001))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_4003))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) 0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)))) is different from false [2022-11-16 10:57:39,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:57:39,903 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 72 treesize of output 57 [2022-11-16 10:57:39,910 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 142 treesize of output 134 [2022-11-16 10:57:39,916 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 128 treesize of output 124 [2022-11-16 10:57:39,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:57:39,937 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:57:39,938 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 81 treesize of output 81 [2022-11-16 10:57:39,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 10:57:39,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 10:57:39,961 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 73 treesize of output 76 [2022-11-16 11:02:27,997 WARN L233 SmtUtils]: Spent 3.74m on a formula simplification. DAG size of input: 174 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:02:30,159 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_213 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_213 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))) (and (or (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_216 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_216) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| v_arrayElimCell_216 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_213 Int) (v_arrayElimCell_216 Int)) (let ((.cse0 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| v_arrayElimCell_216) (= .cse0 (select (store (store |c_#valid| v_arrayElimCell_213 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse0 (select (store (store |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse0 (select (store (store |c_#valid| v_arrayElimCell_216 0) |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse1 (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|))) (or (and (< 0 (+ |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 1)) (< |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 1)) .cse1))) is different from false [2022-11-16 11:02:46,681 WARN L233 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:02:46,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192491703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:02:46,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:02:46,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 47 [2022-11-16 11:02:46,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870857154] [2022-11-16 11:02:46,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:02:46,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 11:02:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 11:02:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2598, Unknown=38, NotChecked=1482, Total=4290 [2022-11-16 11:02:46,684 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 43 states have internal predecessors, (119), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:02:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:02:53,196 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-11-16 11:02:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:02:53,197 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 43 states have internal predecessors, (119), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 76 [2022-11-16 11:02:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:02:53,197 INFO L225 Difference]: With dead ends: 69 [2022-11-16 11:02:53,197 INFO L226 Difference]: Without dead ends: 0 [2022-11-16 11:02:53,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 311.9s TimeCoverageRelationStatistics Valid=372, Invalid=4333, Unknown=39, NotChecked=1898, Total=6642 [2022-11-16 11:02:53,198 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 268 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:02:53,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 706 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1123 Invalid, 0 Unknown, 111 Unchecked, 1.3s Time] [2022-11-16 11:02:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-16 11:02:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-16 11:02:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 11:02:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-16 11:02:53,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-11-16 11:02:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:02:53,199 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-16 11:02:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 43 states have internal predecessors, (119), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 11:02:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-16 11:02:53,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-16 11:02:53,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 28 remaining) [2022-11-16 11:02:53,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 28 remaining) [2022-11-16 11:02:53,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 28 remaining) [2022-11-16 11:02:53,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 28 remaining) [2022-11-16 11:02:53,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 28 remaining) [2022-11-16 11:02:53,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 28 remaining) [2022-11-16 11:02:53,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 28 remaining) [2022-11-16 11:02:53,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 28 remaining) [2022-11-16 11:02:53,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 28 remaining) [2022-11-16 11:02:53,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 28 remaining) [2022-11-16 11:02:53,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 28 remaining) [2022-11-16 11:02:53,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 28 remaining) [2022-11-16 11:02:53,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 28 remaining) [2022-11-16 11:02:53,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 28 remaining) [2022-11-16 11:02:53,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 28 remaining) [2022-11-16 11:02:53,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 28 remaining) [2022-11-16 11:02:53,204 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (11 of 28 remaining) [2022-11-16 11:02:53,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (10 of 28 remaining) [2022-11-16 11:02:53,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (9 of 28 remaining) [2022-11-16 11:02:53,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (8 of 28 remaining) [2022-11-16 11:02:53,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (7 of 28 remaining) [2022-11-16 11:02:53,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (6 of 28 remaining) [2022-11-16 11:02:53,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (5 of 28 remaining) [2022-11-16 11:02:53,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (4 of 28 remaining) [2022-11-16 11:02:53,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 28 remaining) [2022-11-16 11:02:53,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 28 remaining) [2022-11-16 11:02:53,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 28 remaining) [2022-11-16 11:02:53,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 28 remaining) [2022-11-16 11:02:53,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-16 11:02:53,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-16 11:02:53,409 INFO L444 BasicCegarLoop]: Path program histogram: [4, 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, 1] [2022-11-16 11:02:53,412 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:02:53,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:02:53 BoogieIcfgContainer [2022-11-16 11:02:53,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:02:53,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:02:53,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:02:53,416 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:02:53,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:54:26" (3/4) ... [2022-11-16 11:02:53,419 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 11:02:53,431 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-16 11:02:53,438 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-16 11:02:53,439 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-16 11:02:53,439 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-16 11:02:53,439 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 11:02:53,478 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:02:53,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:02:53,479 INFO L158 Benchmark]: Toolchain (without parser) took 508840.08ms. Allocated memory was 92.3MB in the beginning and 490.7MB in the end (delta: 398.5MB). Free memory was 54.8MB in the beginning and 236.5MB in the end (delta: -181.7MB). Peak memory consumption was 215.9MB. Max. memory is 16.1GB. [2022-11-16 11:02:53,479 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 92.3MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:02:53,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 827.27ms. Allocated memory is still 92.3MB. Free memory was 54.6MB in the beginning and 60.0MB in the end (delta: -5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:02:53,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.69ms. Allocated memory is still 92.3MB. Free memory was 60.0MB in the beginning and 57.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:02:53,480 INFO L158 Benchmark]: Boogie Preprocessor took 62.63ms. Allocated memory is still 92.3MB. Free memory was 57.9MB in the beginning and 56.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:02:53,480 INFO L158 Benchmark]: RCFGBuilder took 802.57ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.8MB in the beginning and 86.0MB in the end (delta: -30.2MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-11-16 11:02:53,480 INFO L158 Benchmark]: TraceAbstraction took 506963.61ms. Allocated memory was 111.1MB in the beginning and 490.7MB in the end (delta: 379.6MB). Free memory was 85.5MB in the beginning and 240.2MB in the end (delta: -154.7MB). Peak memory consumption was 225.4MB. Max. memory is 16.1GB. [2022-11-16 11:02:53,481 INFO L158 Benchmark]: Witness Printer took 63.30ms. Allocated memory is still 490.7MB. Free memory was 240.2MB in the beginning and 236.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:02:53,482 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 92.3MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 827.27ms. Allocated memory is still 92.3MB. Free memory was 54.6MB in the beginning and 60.0MB in the end (delta: -5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.69ms. Allocated memory is still 92.3MB. Free memory was 60.0MB in the beginning and 57.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.63ms. Allocated memory is still 92.3MB. Free memory was 57.9MB in the beginning and 56.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 802.57ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.8MB in the beginning and 86.0MB in the end (delta: -30.2MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 506963.61ms. Allocated memory was 111.1MB in the beginning and 490.7MB in the end (delta: 379.6MB). Free memory was 85.5MB in the beginning and 240.2MB in the end (delta: -154.7MB). Peak memory consumption was 225.4MB. Max. memory is 16.1GB. * Witness Printer took 63.30ms. Allocated memory is still 490.7MB. Free memory was 240.2MB in the beginning and 236.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 506.9s, OverallIterations: 38, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 43.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11004 SdHoareTripleChecker+Valid, 14.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10999 mSDsluCounter, 23543 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3253 IncrementalHoareTripleChecker+Unchecked, 21308 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18812 IncrementalHoareTripleChecker+Invalid, 22482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 2235 mSDtfsCounter, 18812 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3069 GetRequests, 1815 SyntacticMatches, 58 SemanticMatches, 1196 ConstructedPredicates, 44 IntricatePredicates, 0 DeprecatedPredicates, 12668 ImplicationChecksByTransitivity, 416.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=16, InterpolantAutomatonStates: 503, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 877 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 449.7s InterpolantComputationTime, 2967 NumberOfCodeBlocks, 2946 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 3601 ConstructedInterpolants, 114 QuantifiedInterpolants, 35613 SizeOfPredicates, 417 NumberOfNonLiveVariables, 8618 ConjunctsInSsa, 1207 ConjunctsInUnsatCore, 75 InterpolantComputations, 17 PerfectInterpolantSequences, 929/1451 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-16 11:02:53,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_668d7d45-3845-489c-b70b-62bc99d3a6d5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE