./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:45:55,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:45:55,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:45:55,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:45:55,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:45:55,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:45:55,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:45:55,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:45:55,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:45:55,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:45:55,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:45:55,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:45:55,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:45:55,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:45:55,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:45:55,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:45:55,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:45:55,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:45:55,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:45:55,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:45:55,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:45:55,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:45:55,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:45:55,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:45:55,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:45:55,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:45:55,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:45:55,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:45:55,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:45:55,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:45:55,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:45:55,446 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:45:55,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:45:55,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:45:55,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:45:55,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:45:55,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:45:55,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:45:55,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:45:55,452 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:45:55,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:45:55,454 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:45:55,490 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:45:55,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:45:55,491 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:45:55,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:45:55,492 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:45:55,492 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:45:55,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:45:55,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:45:55,493 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:45:55,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:45:55,494 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:45:55,495 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:45:55,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:45:55,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:45:55,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:45:55,495 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:45:55,496 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:45:55,496 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:45:55,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:45:55,496 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:45:55,496 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:45:55,497 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:45:55,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:45:55,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:45:55,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:45:55,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:55,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:45:55,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:45:55,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:45:55,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:45:55,499 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_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2022-11-02 20:45:55,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:45:55,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:45:55,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:45:55,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:45:55,815 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:45:55,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-11-02 20:45:55,896 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/data/5ef8eb8a8/57b9861f2d3c4136a830620f05f71b7c/FLAG62d810a56 [2022-11-02 20:45:56,491 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:45:56,492 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-11-02 20:45:56,511 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/data/5ef8eb8a8/57b9861f2d3c4136a830620f05f71b7c/FLAG62d810a56 [2022-11-02 20:45:56,749 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/data/5ef8eb8a8/57b9861f2d3c4136a830620f05f71b7c [2022-11-02 20:45:56,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:45:56,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:45:56,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:56,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:45:56,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:45:56,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:56" (1/1) ... [2022-11-02 20:45:56,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ac8242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:56, skipping insertion in model container [2022-11-02 20:45:56,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:56" (1/1) ... [2022-11-02 20:45:56,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:45:56,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:45:57,280 WARN L230 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_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-11-02 20:45:57,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:57,297 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:45:57,366 WARN L230 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_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-11-02 20:45:57,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:57,401 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:45:57,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57 WrapperNode [2022-11-02 20:45:57,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:57,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:57,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:45:57,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:45:57,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,455 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,492 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-11-02 20:45:57,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:57,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:45:57,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:45:57,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:45:57,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,556 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:45:57,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:45:57,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:45:57,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:45:57,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (1/1) ... [2022-11-02 20:45:57,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:57,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:57,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:45:57,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:45:57,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:45:57,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:45:57,643 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:45:57,644 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:45:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:45:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:45:57,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:45:57,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:45:57,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:45:57,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:45:57,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:45:57,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:45:57,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:45:57,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:45:57,817 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:45:57,819 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:45:58,245 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:45:58,253 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:45:58,253 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:45:58,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:58 BoogieIcfgContainer [2022-11-02 20:45:58,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:45:58,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:45:58,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:45:58,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:45:58,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:45:56" (1/3) ... [2022-11-02 20:45:58,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fd467e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:58, skipping insertion in model container [2022-11-02 20:45:58,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:57" (2/3) ... [2022-11-02 20:45:58,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fd467e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:58, skipping insertion in model container [2022-11-02 20:45:58,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:58" (3/3) ... [2022-11-02 20:45:58,268 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-11-02 20:45:58,289 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:45:58,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2022-11-02 20:45:58,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:45:58,349 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;@7e27abec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:45:58,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2022-11-02 20:45:58,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 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-02 20:45:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:45:58,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:58,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:58,365 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:45:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964311, now seen corresponding path program 1 times [2022-11-02 20:45:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:58,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570211206] [2022-11-02 20:45:58,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:58,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:58,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570211206] [2022-11-02 20:45:58,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570211206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:58,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:58,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:45:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629251603] [2022-11-02 20:45:58,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:58,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:58,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:58,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:58,767 INFO L87 Difference]: Start difference. First operand has 108 states, 57 states have (on average 2.087719298245614) internal successors, (119), 104 states have internal predecessors, (119), 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 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02 20:45:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:58,980 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-11-02 20:45:58,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:58,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-11-02 20:45:58,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:58,991 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:45:58,991 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:45:58,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:58,996 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:58,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 164 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:45:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:45:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-02 20:45:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 98 states have internal predecessors, (107), 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-02 20:45:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-11-02 20:45:59,049 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2022-11-02 20:45:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:59,050 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-11-02 20:45:59,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02 20:45:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-11-02 20:45:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:45:59,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:59,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:59,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:45:59,053 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:45:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:59,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964312, now seen corresponding path program 1 times [2022-11-02 20:45:59,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:59,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537532791] [2022-11-02 20:45:59,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:59,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:59,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:59,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537532791] [2022-11-02 20:45:59,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537532791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:59,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:59,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:45:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047684363] [2022-11-02 20:45:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:59,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:45:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:45:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:59,245 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02 20:45:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:59,330 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-11-02 20:45:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:45:59,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2022-11-02 20:45:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:45:59,332 INFO L225 Difference]: With dead ends: 99 [2022-11-02 20:45:59,332 INFO L226 Difference]: Without dead ends: 99 [2022-11-02 20:45:59,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:45:59,334 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:45:59,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 164 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:45:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-02 20:45:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-02 20:45:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 95 states have internal predecessors, (104), 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-02 20:45:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-02 20:45:59,343 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 7 [2022-11-02 20:45:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:45:59,343 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-02 20:45:59,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-02 20:45:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-02 20:45:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:45:59,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:45:59,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:59,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:45:59,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:45:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -418267899, now seen corresponding path program 1 times [2022-11-02 20:45:59,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:59,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416663296] [2022-11-02 20:45:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:45:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:45:59,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:59,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416663296] [2022-11-02 20:45:59,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416663296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:45:59,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:45:59,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:45:59,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841052041] [2022-11-02 20:45:59,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:45:59,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:45:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:59,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:45:59,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:45:59,861 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-02 20:46:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:00,200 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-11-02 20:46:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:46:00,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2022-11-02 20:46:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:00,203 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:46:00,204 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:46:00,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:46:00,205 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 20 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:00,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 476 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:46:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:46:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-11-02 20:46:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 93 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-02 20:46:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-11-02 20:46:00,215 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 14 [2022-11-02 20:46:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:00,216 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-11-02 20:46:00,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-02 20:46:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-11-02 20:46:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:46:00,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:00,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:00,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:46:00,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:00,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash -418267900, now seen corresponding path program 1 times [2022-11-02 20:46:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:00,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883256931] [2022-11-02 20:46:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:00,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883256931] [2022-11-02 20:46:00,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883256931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:00,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:00,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:46:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522861187] [2022-11-02 20:46:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:00,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:46:00,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:46:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:46:00,345 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-02 20:46:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:00,609 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-11-02 20:46:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:46:00,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2022-11-02 20:46:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:00,612 INFO L225 Difference]: With dead ends: 100 [2022-11-02 20:46:00,612 INFO L226 Difference]: Without dead ends: 100 [2022-11-02 20:46:00,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:00,623 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 15 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:00,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 361 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:46:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-02 20:46:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-11-02 20:46:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 91 states have internal predecessors, (100), 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-02 20:46:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-11-02 20:46:00,630 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 14 [2022-11-02 20:46:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:00,630 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-11-02 20:46:00,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-02 20:46:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-11-02 20:46:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:46:00,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:00,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:00,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:46:00,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:00,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1186059880, now seen corresponding path program 1 times [2022-11-02 20:46:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:00,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937966758] [2022-11-02 20:46:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:46:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937966758] [2022-11-02 20:46:00,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937966758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:00,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:00,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:46:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763992844] [2022-11-02 20:46:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:00,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:46:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:00,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:46:00,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:46:00,746 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-02 20:46:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:00,852 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-11-02 20:46:00,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:46:00,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-11-02 20:46:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:00,854 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:46:00,854 INFO L226 Difference]: Without dead ends: 105 [2022-11-02 20:46:00,855 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-02 20:46:00,856 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:00,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 241 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:46:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-02 20:46:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2022-11-02 20:46:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 92 states have internal predecessors, (101), 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-02 20:46:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-11-02 20:46:00,863 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 16 [2022-11-02 20:46:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:00,863 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-11-02 20:46:00,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-02 20:46:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-11-02 20:46:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:46:00,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:00,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:00,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:46:00,865 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:00,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:00,866 INFO L85 PathProgramCache]: Analyzing trace with hash -918895952, now seen corresponding path program 1 times [2022-11-02 20:46:00,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:00,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657436723] [2022-11-02 20:46:00,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:00,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:00,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657436723] [2022-11-02 20:46:00,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657436723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:00,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:00,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:46:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956394143] [2022-11-02 20:46:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:00,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:46:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:01,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:46:01,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:46:01,001 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-02 20:46:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:01,108 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-02 20:46:01,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:46:01,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2022-11-02 20:46:01,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:01,110 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:46:01,110 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:46:01,111 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-02 20:46:01,114 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:01,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 237 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:46:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:46:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-11-02 20:46:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.75) internal successors, (105), 96 states have internal predecessors, (105), 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-02 20:46:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-11-02 20:46:01,138 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 17 [2022-11-02 20:46:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:01,139 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-11-02 20:46:01,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-02 20:46:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-11-02 20:46:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:46:01,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:01,141 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:01,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:46:01,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1802773707, now seen corresponding path program 1 times [2022-11-02 20:46:01,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:01,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658312852] [2022-11-02 20:46:01,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:01,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:46:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,354 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-02 20:46:01,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:01,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658312852] [2022-11-02 20:46:01,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658312852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:01,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877364936] [2022-11-02 20:46:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:01,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:01,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:01,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:01,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:46:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:01,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:46:01,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:01,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:01,680 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-02 20:46:01,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877364936] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:46:01,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:46:01,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-02 20:46:01,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767720385] [2022-11-02 20:46:01,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:01,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:01,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:01,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:01,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:01,683 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:46:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:01,798 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-11-02 20:46:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:46:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-11-02 20:46:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:01,800 INFO L225 Difference]: With dead ends: 103 [2022-11-02 20:46:01,800 INFO L226 Difference]: Without dead ends: 103 [2022-11-02 20:46:01,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:01,801 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 14 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:01,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 428 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:46:01,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-02 20:46:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-02 20:46:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 98 states have internal predecessors, (107), 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-02 20:46:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-11-02 20:46:01,806 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 31 [2022-11-02 20:46:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:01,810 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-11-02 20:46:01,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:46:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-11-02 20:46:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:46:01,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:01,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:01,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:02,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:02,027 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:02,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash 916543363, now seen corresponding path program 1 times [2022-11-02 20:46:02,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:02,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778256638] [2022-11-02 20:46:02,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:02,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:02,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:46:02,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:02,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778256638] [2022-11-02 20:46:02,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778256638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:02,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993844866] [2022-11-02 20:46:02,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:02,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:02,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:02,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:02,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:46:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:02,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:46:02,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:02,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:02,946 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:46:02,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:46:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:02,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:03,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993844866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:03,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:03,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-11-02 20:46:03,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668446912] [2022-11-02 20:46:03,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:03,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:46:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:03,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:46:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:46:03,031 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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-02 20:46:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:03,406 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-11-02 20:46:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:46:03,407 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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 32 [2022-11-02 20:46:03,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:03,408 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:46:03,408 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:46:03,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:46:03,409 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 172 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:03,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 378 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 0 Unknown, 55 Unchecked, 0.3s Time] [2022-11-02 20:46:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:46:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-11-02 20:46:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 62 states have (on average 1.7096774193548387) internal successors, (106), 97 states have internal predecessors, (106), 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-02 20:46:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2022-11-02 20:46:03,414 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2022-11-02 20:46:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:03,414 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2022-11-02 20:46:03,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 9 states have internal predecessors, (38), 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-02 20:46:03,414 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-11-02 20:46:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:46:03,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:03,415 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:03,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:03,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:03,616 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:03,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash 916543364, now seen corresponding path program 1 times [2022-11-02 20:46:03,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:03,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579466451] [2022-11-02 20:46:03,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:03,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:03,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:46:04,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:04,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579466451] [2022-11-02 20:46:04,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579466451] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:04,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543954090] [2022-11-02 20:46:04,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:04,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:04,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:04,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:04,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:46:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:04,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:46:04,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:04,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:04,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:04,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:04,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:46:04,724 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:46:04,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:46:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:04,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:04,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543954090] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:04,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:04,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2022-11-02 20:46:04,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362379770] [2022-11-02 20:46:04,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:04,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:46:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:46:04,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:46:04,904 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 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-02 20:46:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:05,446 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-02 20:46:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:46:05,447 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 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 32 [2022-11-02 20:46:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:05,448 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:46:05,448 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:46:05,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:46:05,449 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 108 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:05,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 397 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 508 Invalid, 0 Unknown, 51 Unchecked, 0.4s Time] [2022-11-02 20:46:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:46:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-11-02 20:46:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 96 states have internal predecessors, (105), 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-02 20:46:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-11-02 20:46:05,454 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2022-11-02 20:46:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:05,454 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-11-02 20:46:05,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 12 states have internal predecessors, (39), 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-02 20:46:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-11-02 20:46:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:46:05,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:05,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:05,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:05,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:05,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2135424312, now seen corresponding path program 2 times [2022-11-02 20:46:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:05,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985321616] [2022-11-02 20:46:05,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:05,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:05,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:05,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:46:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:46:05,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:05,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985321616] [2022-11-02 20:46:05,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985321616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:05,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948382493] [2022-11-02 20:46:05,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:46:05,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:05,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:05,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:05,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:46:06,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:46:06,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:46:06,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-02 20:46:06,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:46:06,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:46:06,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948382493] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:46:06,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:46:06,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-11-02 20:46:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571756523] [2022-11-02 20:46:06,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:06,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:46:06,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:06,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:46:06,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:46:06,331 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:46:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:06,547 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-11-02 20:46:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:46:06,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-11-02 20:46:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:06,548 INFO L225 Difference]: With dead ends: 101 [2022-11-02 20:46:06,548 INFO L226 Difference]: Without dead ends: 101 [2022-11-02 20:46:06,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:46:06,549 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 170 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:06,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 411 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:46:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-02 20:46:06,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-02 20:46:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6774193548387097) internal successors, (104), 96 states have internal predecessors, (104), 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-02 20:46:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-11-02 20:46:06,554 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2022-11-02 20:46:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:06,554 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-11-02 20:46:06,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:46:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-11-02 20:46:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:46:06,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:06,557 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:06,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:06,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:06,771 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:06,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:06,771 INFO L85 PathProgramCache]: Analyzing trace with hash 568631680, now seen corresponding path program 1 times [2022-11-02 20:46:06,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:06,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754648179] [2022-11-02 20:46:06,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:06,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:07,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:07,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:46:07,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754648179] [2022-11-02 20:46:07,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754648179] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628969313] [2022-11-02 20:46:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:07,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:07,349 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:07,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:46:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:07,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-02 20:46:07,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:07,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:07,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:46:07,747 WARN L833 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) is different from false [2022-11-02 20:46:07,750 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)) is different from true [2022-11-02 20:46:07,818 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:46:07,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:46:07,872 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:46:07,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:46:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 1 not checked. [2022-11-02 20:46:07,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:08,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628969313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:08,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:08,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-11-02 20:46:08,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865260588] [2022-11-02 20:46:08,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:08,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:46:08,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:08,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:46:08,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=142, Unknown=2, NotChecked=24, Total=210 [2022-11-02 20:46:08,214 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 10 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:46:08,294 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 20:46:08,297 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 20:46:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:08,666 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-11-02 20:46:08,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:46:08,667 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 10 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-11-02 20:46:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:08,668 INFO L225 Difference]: With dead ends: 109 [2022-11-02 20:46:08,668 INFO L226 Difference]: Without dead ends: 109 [2022-11-02 20:46:08,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=240, Unknown=4, NotChecked=66, Total=380 [2022-11-02 20:46:08,669 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 117 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:08,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 391 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 340 Invalid, 0 Unknown, 158 Unchecked, 0.4s Time] [2022-11-02 20:46:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-02 20:46:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2022-11-02 20:46:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 92 states have internal predecessors, (100), 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-02 20:46:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-11-02 20:46:08,673 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 47 [2022-11-02 20:46:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:08,673 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-11-02 20:46:08,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 10 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:46:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-11-02 20:46:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:46:08,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:08,674 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:08,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:08,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:08,887 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash 568631681, now seen corresponding path program 1 times [2022-11-02 20:46:08,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:08,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362302964] [2022-11-02 20:46:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:08,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:09,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:09,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:09,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:46:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:09,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362302964] [2022-11-02 20:46:09,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362302964] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:09,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951207218] [2022-11-02 20:46:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:09,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:09,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:09,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:09,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:46:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:09,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-02 20:46:09,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:09,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:09,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:46:10,103 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-02 20:46:10,105 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-02 20:46:10,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:46:10,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:46:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 1 not checked. [2022-11-02 20:46:10,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:10,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951207218] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:10,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:10,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2022-11-02 20:46:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621047169] [2022-11-02 20:46:10,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:10,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:46:10,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:10,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:46:10,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=144, Unknown=2, NotChecked=24, Total=210 [2022-11-02 20:46:10,595 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:46:10,668 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 20:46:10,670 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 20:46:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:11,019 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-11-02 20:46:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:46:11,020 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-11-02 20:46:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:11,021 INFO L225 Difference]: With dead ends: 104 [2022-11-02 20:46:11,021 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 20:46:11,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=212, Unknown=4, NotChecked=62, Total=342 [2022-11-02 20:46:11,022 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 207 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:11,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 269 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 360 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2022-11-02 20:46:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 20:46:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-11-02 20:46:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.532258064516129) internal successors, (95), 87 states have internal predecessors, (95), 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-02 20:46:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-11-02 20:46:11,026 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 47 [2022-11-02 20:46:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:11,027 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-11-02 20:46:11,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:46:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-11-02 20:46:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:46:11,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:11,028 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-02 20:46:11,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:46:11,243 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985862, now seen corresponding path program 1 times [2022-11-02 20:46:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:11,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192223822] [2022-11-02 20:46:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:11,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:11,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:11,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:46:12,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:12,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192223822] [2022-11-02 20:46:12,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192223822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:12,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651964194] [2022-11-02 20:46:12,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:12,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:12,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:12,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:12,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:46:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:12,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 20:46:12,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:12,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:12,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-02 20:46:13,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:13,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:46:13,143 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-02 20:46:13,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:46:13,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:46:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:46:13,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:13,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1682 (Array Int Int)) (|v_node_create_~temp~0#1.base_52| Int)) (or (not (< |v_node_create_~temp~0#1.base_52| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_52| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_52| v_ArrVal_1682) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) 1))) is different from false [2022-11-02 20:46:13,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651964194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:13,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:13,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-11-02 20:46:13,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212903479] [2022-11-02 20:46:13,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:13,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 20:46:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 20:46:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=672, Unknown=3, NotChecked=52, Total=812 [2022-11-02 20:46:13,335 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:14,243 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-11-02 20:46:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:46:14,244 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-02 20:46:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:14,244 INFO L225 Difference]: With dead ends: 133 [2022-11-02 20:46:14,245 INFO L226 Difference]: Without dead ends: 133 [2022-11-02 20:46:14,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=138, Invalid=982, Unknown=6, NotChecked=64, Total=1190 [2022-11-02 20:46:14,246 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 77 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:14,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1017 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 763 Invalid, 0 Unknown, 144 Unchecked, 0.6s Time] [2022-11-02 20:46:14,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-02 20:46:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 91. [2022-11-02 20:46:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.507936507936508) internal successors, (95), 86 states have internal predecessors, (95), 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-02 20:46:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-11-02 20:46:14,249 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 51 [2022-11-02 20:46:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:14,250 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-11-02 20:46:14,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.92) internal successors, (73), 24 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-11-02 20:46:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:46:14,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:14,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-02 20:46:14,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:14,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:14,452 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:14,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985863, now seen corresponding path program 1 times [2022-11-02 20:46:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:14,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676942238] [2022-11-02 20:46:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:14,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:15,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:15,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:46:16,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:16,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676942238] [2022-11-02 20:46:16,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676942238] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:16,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714625530] [2022-11-02 20:46:16,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:16,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:16,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:16,303 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:16,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:46:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:16,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-02 20:46:16,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:16,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:17,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-02 20:46:17,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:46:17,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:17,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:46:17,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:17,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-02 20:46:17,559 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:46:17,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:46:17,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:46:17,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:46:17,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:46:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:46:17,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:18,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714625530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:18,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:18,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2022-11-02 20:46:18,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181143798] [2022-11-02 20:46:18,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:18,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:46:18,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:18,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:46:18,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1225, Unknown=2, NotChecked=0, Total=1332 [2022-11-02 20:46:18,915 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:21,343 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2022-11-02 20:46:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:46:21,344 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-02 20:46:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:21,345 INFO L225 Difference]: With dead ends: 141 [2022-11-02 20:46:21,345 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 20:46:21,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=214, Invalid=2132, Unknown=6, NotChecked=0, Total=2352 [2022-11-02 20:46:21,346 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 205 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:21,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1665 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1274 Invalid, 0 Unknown, 110 Unchecked, 1.1s Time] [2022-11-02 20:46:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 20:46:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2022-11-02 20:46:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 89 states have internal predecessors, (98), 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-02 20:46:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-11-02 20:46:21,350 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 51 [2022-11-02 20:46:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:21,350 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-11-02 20:46:21,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.7) internal successors, (81), 29 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-11-02 20:46:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:46:21,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:21,351 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-02 20:46:21,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:21,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:46:21,563 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:21,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1941832962, now seen corresponding path program 1 times [2022-11-02 20:46:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:21,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491737246] [2022-11-02 20:46:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:21,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:21,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:46:21,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:21,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491737246] [2022-11-02 20:46:21,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491737246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:21,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:21,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:46:21,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907392528] [2022-11-02 20:46:21,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:21,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:46:21,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:21,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:46:21,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:21,730 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-02 20:46:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:21,836 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-11-02 20:46:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:46:21,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) Word has length 51 [2022-11-02 20:46:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:21,837 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:46:21,837 INFO L226 Difference]: Without dead ends: 105 [2022-11-02 20:46:21,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:46:21,838 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 194 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:21,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 148 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:46:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-02 20:46:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2022-11-02 20:46:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 88 states have internal predecessors, (97), 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-02 20:46:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-11-02 20:46:21,841 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 51 [2022-11-02 20:46:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:21,842 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-11-02 20:46:21,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-02 20:46:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-11-02 20:46:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:46:21,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:21,843 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:21,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:46:21,843 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:21,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671715, now seen corresponding path program 1 times [2022-11-02 20:46:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:21,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609311104] [2022-11-02 20:46:21,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:22,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:22,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-02 20:46:22,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:22,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609311104] [2022-11-02 20:46:22,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609311104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:22,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:22,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:46:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929803336] [2022-11-02 20:46:22,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:22,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:46:22,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:22,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:46:22,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:46:22,229 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:46:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:22,565 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-11-02 20:46:22,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:46:22,565 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-11-02 20:46:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:22,566 INFO L225 Difference]: With dead ends: 141 [2022-11-02 20:46:22,566 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 20:46:22,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:46:22,572 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 220 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:22,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 356 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:46:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 20:46:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2022-11-02 20:46:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.408450704225352) internal successors, (100), 89 states have internal predecessors, (100), 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-02 20:46:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2022-11-02 20:46:22,578 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 53 [2022-11-02 20:46:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:22,579 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2022-11-02 20:46:22,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:46:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2022-11-02 20:46:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:46:22,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:22,580 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:22,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:46:22,581 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671716, now seen corresponding path program 1 times [2022-11-02 20:46:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:22,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197512153] [2022-11-02 20:46:22,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:22,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:23,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:46:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:23,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197512153] [2022-11-02 20:46:23,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197512153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:23,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:23,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:46:23,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020194280] [2022-11-02 20:46:23,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:23,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:46:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:23,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:46:23,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:46:23,224 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:46:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:23,601 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2022-11-02 20:46:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:46:23,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-11-02 20:46:23,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:23,605 INFO L225 Difference]: With dead ends: 151 [2022-11-02 20:46:23,605 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 20:46:23,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:46:23,606 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 190 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:23,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 398 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:46:23,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 20:46:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 100. [2022-11-02 20:46:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 95 states have internal predecessors, (108), 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-02 20:46:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-11-02 20:46:23,616 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-11-02 20:46:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:23,617 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-11-02 20:46:23,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:46:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-11-02 20:46:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:46:23,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:23,618 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-02 20:46:23,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:46:23,620 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:23,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:23,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352068, now seen corresponding path program 1 times [2022-11-02 20:46:23,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:23,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503254200] [2022-11-02 20:46:23,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:23,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:24,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:25,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:46:26,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:26,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503254200] [2022-11-02 20:46:26,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503254200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:26,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028697664] [2022-11-02 20:46:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:26,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:26,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:26,108 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:26,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:46:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:26,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-02 20:46:26,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:26,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:26,841 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:46:26,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:46:26,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:46:27,079 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:46:27,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-02 20:46:27,399 INFO L356 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-02 20:46:27,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 33 [2022-11-02 20:46:27,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:46:27,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:46:27,668 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2677 (Array Int Int)) (v_ArrVal_2676 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2676) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2677) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-02 20:46:27,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:27,746 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:46:27,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-11-02 20:46:27,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:27,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-11-02 20:46:27,794 INFO L356 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2022-11-02 20:46:27,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2022-11-02 20:46:27,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-11-02 20:46:28,089 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-02 20:46:28,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2022-11-02 20:46:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-02 20:46:28,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:28,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2690 Int) (v_ArrVal_2689 (Array Int Int)) (v_ArrVal_2688 (Array Int Int)) (|v_node_create_~temp~0#1.base_58| Int)) (or (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_58|) 0)) (not (< |v_node_create_~temp~0#1.base_58| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_58| v_ArrVal_2690) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_58| v_ArrVal_2689))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_58| v_ArrVal_2688) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) 1))) is different from false [2022-11-02 20:46:28,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028697664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:28,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:28,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-11-02 20:46:28,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154530059] [2022-11-02 20:46:28,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:28,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:46:28,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:28,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:46:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2271, Unknown=2, NotChecked=194, Total=2652 [2022-11-02 20:46:28,472 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:46:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:30,144 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2022-11-02 20:46:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:46:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-11-02 20:46:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:30,146 INFO L225 Difference]: With dead ends: 103 [2022-11-02 20:46:30,146 INFO L226 Difference]: Without dead ends: 103 [2022-11-02 20:46:30,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=335, Invalid=3577, Unknown=2, NotChecked=246, Total=4160 [2022-11-02 20:46:30,148 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:30,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1295 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1042 Invalid, 0 Unknown, 207 Unchecked, 0.9s Time] [2022-11-02 20:46:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-02 20:46:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2022-11-02 20:46:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3875) internal successors, (111), 97 states have internal predecessors, (111), 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-02 20:46:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2022-11-02 20:46:30,153 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 55 [2022-11-02 20:46:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:30,154 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2022-11-02 20:46:30,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0) internal successors, (90), 41 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:46:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2022-11-02 20:46:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:46:30,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:30,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-02 20:46:30,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:30,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:46:30,375 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:30,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:30,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352067, now seen corresponding path program 1 times [2022-11-02 20:46:30,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:30,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203926204] [2022-11-02 20:46:30,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:32,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:32,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:46:33,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203926204] [2022-11-02 20:46:33,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203926204] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519378848] [2022-11-02 20:46:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:33,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:33,928 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:33,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:46:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:34,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-02 20:46:34,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:34,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:34,794 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:46:34,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:46:34,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:46:34,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:46:35,089 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:46:35,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2022-11-02 20:46:35,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-11-02 20:46:35,516 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 20:46:35,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 48 [2022-11-02 20:46:35,534 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-02 20:46:35,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 25 [2022-11-02 20:46:35,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:46:35,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:46:36,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:36,073 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:46:36,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 97 [2022-11-02 20:46:36,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:36,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:36,089 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:46:36,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 91 [2022-11-02 20:46:36,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:36,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-11-02 20:46:36,122 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-02 20:46:36,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-02 20:46:36,492 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 20:46:36,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 54 [2022-11-02 20:46:36,504 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-02 20:46:36,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-11-02 20:46:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:46:36,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:37,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519378848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:37,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:37,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-11-02 20:46:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549889405] [2022-11-02 20:46:37,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:37,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-02 20:46:37,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:37,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-02 20:46:37,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3117, Unknown=6, NotChecked=0, Total=3306 [2022-11-02 20:46:37,324 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:46:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:42,074 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2022-11-02 20:46:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:46:42,075 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2022-11-02 20:46:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:42,076 INFO L225 Difference]: With dead ends: 196 [2022-11-02 20:46:42,076 INFO L226 Difference]: Without dead ends: 196 [2022-11-02 20:46:42,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=445, Invalid=5249, Unknown=6, NotChecked=0, Total=5700 [2022-11-02 20:46:42,077 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 567 mSDsluCounter, 2286 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:42,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 2366 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2790 Invalid, 0 Unknown, 327 Unchecked, 2.4s Time] [2022-11-02 20:46:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-02 20:46:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 104. [2022-11-02 20:46:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 99 states have internal predecessors, (113), 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-02 20:46:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-11-02 20:46:42,082 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 55 [2022-11-02 20:46:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:42,082 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-11-02 20:46:42,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 45 states have internal predecessors, (95), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:46:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-11-02 20:46:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:46:42,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:42,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:42,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:42,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:42,299 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:42,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:42,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1045714181, now seen corresponding path program 1 times [2022-11-02 20:46:42,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:42,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709910362] [2022-11-02 20:46:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:42,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:42,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:42,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:42,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:46:43,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:43,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709910362] [2022-11-02 20:46:43,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709910362] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:43,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324331371] [2022-11-02 20:46:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:43,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:43,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:43,014 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:43,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:46:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:43,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 20:46:43,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:43,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:46:43,789 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3221 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3221)))) is different from true [2022-11-02 20:46:43,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:43,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-02 20:46:43,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:46:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-02 20:46:43,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:43,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3226 (Array Int Int)) (|v_node_create_~temp~0#1.base_64| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_64| v_ArrVal_3226) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (<= 1 .cse0) (not (< |v_node_create_~temp~0#1.base_64| |c_#StackHeapBarrier|))))) is different from false [2022-11-02 20:46:43,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324331371] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:43,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:43,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-02 20:46:43,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020896418] [2022-11-02 20:46:43,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:43,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 20:46:43,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:43,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:46:43,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-11-02 20:46:43,987 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:44,851 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-11-02 20:46:44,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:46:44,851 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-11-02 20:46:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:44,852 INFO L225 Difference]: With dead ends: 92 [2022-11-02 20:46:44,852 INFO L226 Difference]: Without dead ends: 92 [2022-11-02 20:46:44,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2022-11-02 20:46:44,853 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 355 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:44,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 615 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 510 Invalid, 0 Unknown, 87 Unchecked, 0.5s Time] [2022-11-02 20:46:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-02 20:46:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-02 20:46:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 87 states have internal predecessors, (97), 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-02 20:46:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-11-02 20:46:44,857 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 56 [2022-11-02 20:46:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:44,858 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-11-02 20:46:44,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-11-02 20:46:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:46:44,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:44,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:46:44,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-02 20:46:45,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:45,064 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343071, now seen corresponding path program 1 times [2022-11-02 20:46:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:45,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222511714] [2022-11-02 20:46:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:45,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:45,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:46:46,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:46,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222511714] [2022-11-02 20:46:46,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222511714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:46:46,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:46:46,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-02 20:46:46,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656125010] [2022-11-02 20:46:46,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:46:46,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:46:46,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:46,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:46:46,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:46:46,070 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:46:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:47,264 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2022-11-02 20:46:47,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:46:47,265 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-11-02 20:46:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:47,266 INFO L225 Difference]: With dead ends: 157 [2022-11-02 20:46:47,266 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 20:46:47,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2022-11-02 20:46:47,268 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 891 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:47,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 445 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:46:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 20:46:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 98. [2022-11-02 20:46:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.368421052631579) internal successors, (104), 93 states have internal predecessors, (104), 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-02 20:46:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-11-02 20:46:47,272 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 58 [2022-11-02 20:46:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:47,273 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-11-02 20:46:47,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:46:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-11-02 20:46:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:46:47,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:47,274 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:46:47,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:46:47,274 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343072, now seen corresponding path program 1 times [2022-11-02 20:46:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:47,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364806692] [2022-11-02 20:46:47,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:46:49,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:49,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364806692] [2022-11-02 20:46:49,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364806692] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:49,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71471218] [2022-11-02 20:46:49,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:49,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:49,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:49,168 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:49,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:46:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:49,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-02 20:46:49,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:49,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:46:49,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:46:49,705 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:46:49,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:46:49,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:46:50,045 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:46:50,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:46:50,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:46:50,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-02 20:46:50,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:50,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2022-11-02 20:46:50,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:50,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-02 20:46:51,293 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:46:51,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-02 20:46:51,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-02 20:46:51,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:51,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-02 20:46:51,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:46:51,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-02 20:46:51,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-02 20:46:51,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:46:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:46:51,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:51,736 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_3670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-02 20:46:51,750 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3668 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3668) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3667 (Array Int Int)) (v_ArrVal_3668 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3668) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3667) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:46:51,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:46:51,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2022-11-02 20:46:51,812 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3668 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3668) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 1))) (forall ((v_ArrVal_3667 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_3667) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-02 20:46:51,833 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_prenex_8) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 1))) (forall ((v_ArrVal_3667 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_ArrVal_3667) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3668 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base| v_ArrVal_3668) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-02 20:46:51,853 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3668 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3668) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_8) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1))) (forall ((v_ArrVal_3667 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3667) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)))) is different from false [2022-11-02 20:46:51,900 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (forall ((v_ArrVal_3667 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3667) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_8) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1))) (forall ((v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3668 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3668) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-02 20:46:52,032 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3679 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3679))) (< (select (select (store (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3680) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_prenex_8) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_prenex_7) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1)))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3670 (Array Int Int)) (v_ArrVal_3679 (Array Int Int)) (v_ArrVal_3668 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3679) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3680) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) v_ArrVal_3668) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| Int)) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_3680 (Array Int Int)) (v_ArrVal_3667 (Array Int Int)) (v_ArrVal_3669 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3680))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (= .cse1 (select (select (store (store .cse2 .cse1 v_ArrVal_3667) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_29| v_ArrVal_3669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-02 20:46:52,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71471218] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:52,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:52,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 44 [2022-11-02 20:46:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725133075] [2022-11-02 20:46:52,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:52,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-02 20:46:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:52,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-02 20:46:52,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2125, Unknown=7, NotChecked=686, Total=2970 [2022-11-02 20:46:52,038 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:55,149 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2022-11-02 20:46:55,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:46:55,149 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-11-02 20:46:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:46:55,152 INFO L225 Difference]: With dead ends: 192 [2022-11-02 20:46:55,152 INFO L226 Difference]: Without dead ends: 192 [2022-11-02 20:46:55,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=526, Invalid=4051, Unknown=7, NotChecked=966, Total=5550 [2022-11-02 20:46:55,156 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1649 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:46:55,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1649 Valid, 921 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:46:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-02 20:46:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 105. [2022-11-02 20:46:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 100 states have internal predecessors, (113), 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-02 20:46:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-02 20:46:55,162 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 58 [2022-11-02 20:46:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:46:55,162 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-02 20:46:55,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.261904761904762) internal successors, (95), 37 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:46:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-02 20:46:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:46:55,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:46:55,163 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-02 20:46:55,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:46:55,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:55,364 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:46:55,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:55,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1757191502, now seen corresponding path program 2 times [2022-11-02 20:46:55,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:55,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191361715] [2022-11-02 20:46:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:57,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:46:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:46:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:58,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:46:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:46:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:46:59,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:59,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191361715] [2022-11-02 20:46:59,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191361715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:46:59,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347390698] [2022-11-02 20:46:59,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:46:59,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:59,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:59,895 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:59,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:47:00,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:47:00,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:47:00,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-02 20:47:00,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:00,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:00,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:47:00,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:47:01,220 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:47:01,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:47:01,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:47:01,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:47:01,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:47:01,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:47:01,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:47:01,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:47:01,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:01,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:01,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:47:01,798 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:47:01,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 73 [2022-11-02 20:47:01,814 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-02 20:47:01,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-11-02 20:47:02,377 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:47:02,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2022-11-02 20:47:02,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:47:02,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:02,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 20:47:02,629 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3950 (Array Int Int)) (v_ArrVal_3951 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3950)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3951)))) is different from true [2022-11-02 20:47:02,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:02,701 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 20:47:02,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 76 [2022-11-02 20:47:02,729 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:47:02,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:47:02,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:02,742 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-02 20:47:02,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-11-02 20:47:03,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:03,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:47:03,589 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-11-02 20:47:03,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 74 [2022-11-02 20:47:03,611 INFO L356 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2022-11-02 20:47:03,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 29 [2022-11-02 20:47:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-02 20:47:03,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:04,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347390698] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:04,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:47:04,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 56 [2022-11-02 20:47:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538470858] [2022-11-02 20:47:04,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:04,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-02 20:47:04,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:04,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-02 20:47:04,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3483, Unknown=3, NotChecked=118, Total=3782 [2022-11-02 20:47:04,590 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:47:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:07,741 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-11-02 20:47:07,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:47:07,742 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-11-02 20:47:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:07,743 INFO L225 Difference]: With dead ends: 128 [2022-11-02 20:47:07,743 INFO L226 Difference]: Without dead ends: 128 [2022-11-02 20:47:07,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=324, Invalid=5683, Unknown=3, NotChecked=152, Total=6162 [2022-11-02 20:47:07,744 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 29 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:07,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1839 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1505 Invalid, 0 Unknown, 310 Unchecked, 1.3s Time] [2022-11-02 20:47:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-02 20:47:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-11-02 20:47:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 120 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:47:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2022-11-02 20:47:07,749 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 59 [2022-11-02 20:47:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:07,749 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2022-11-02 20:47:07,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 50 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:47:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2022-11-02 20:47:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:47:07,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:07,751 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:07,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:07,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 20:47:07,971 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:47:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2022079807, now seen corresponding path program 1 times [2022-11-02 20:47:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:07,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697760508] [2022-11-02 20:47:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:47:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:09,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:47:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:47:10,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:10,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697760508] [2022-11-02 20:47:10,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697760508] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:10,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466609133] [2022-11-02 20:47:10,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:10,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:10,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:10,295 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:10,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:47:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:10,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-02 20:47:10,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:10,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:11,155 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:47:11,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:47:11,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:47:11,429 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:47:11,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-02 20:47:11,744 INFO L356 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-02 20:47:11,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 37 [2022-11-02 20:47:11,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-02 20:47:11,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:47:12,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:12,115 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-02 20:47:12,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 62 [2022-11-02 20:47:12,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:12,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2022-11-02 20:47:12,143 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-02 20:47:12,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-02 20:47:12,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-11-02 20:47:12,430 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-02 20:47:12,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 26 [2022-11-02 20:47:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:12,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:12,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| Int) (v_ArrVal_4249 (Array Int Int)) (v_ArrVal_4250 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34|) 0)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_4249))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_4250) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:47:12,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466609133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:12,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:47:12,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 51 [2022-11-02 20:47:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514123480] [2022-11-02 20:47:12,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:12,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-02 20:47:12,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:12,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-02 20:47:12,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2683, Unknown=1, NotChecked=104, Total=2970 [2022-11-02 20:47:12,744 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:47:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:15,715 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2022-11-02 20:47:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:47:15,716 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2022-11-02 20:47:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:15,716 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:47:15,716 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:47:15,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=468, Invalid=4791, Unknown=1, NotChecked=142, Total=5402 [2022-11-02 20:47:15,717 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 105 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:15,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1086 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1043 Invalid, 0 Unknown, 82 Unchecked, 1.0s Time] [2022-11-02 20:47:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:47:15,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-02 20:47:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.3) internal successors, (117), 107 states have internal predecessors, (117), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:47:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2022-11-02 20:47:15,723 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 61 [2022-11-02 20:47:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:15,723 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2022-11-02 20:47:15,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 43 states have internal predecessors, (96), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:47:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2022-11-02 20:47:15,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:47:15,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:15,725 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:15,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:15,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:15,931 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:47:15,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901353, now seen corresponding path program 1 times [2022-11-02 20:47:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:15,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896279429] [2022-11-02 20:47:15,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:47:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:47:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:47:17,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:17,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896279429] [2022-11-02 20:47:17,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896279429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:17,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301317283] [2022-11-02 20:47:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:17,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:17,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:17,416 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:17,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:47:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:17,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-02 20:47:17,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:17,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:18,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-02 20:47:18,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:18,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-02 20:47:18,744 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-02 20:47:18,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-02 20:47:19,439 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-02 20:47:19,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2022-11-02 20:47:19,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:19,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-02 20:47:19,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:47:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:47:19,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:19,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4526 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4526) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-02 20:47:20,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301317283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:20,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:47:20,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 50 [2022-11-02 20:47:20,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021817982] [2022-11-02 20:47:20,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:20,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-02 20:47:20,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:20,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-02 20:47:20,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3150, Unknown=32, NotChecked=114, Total=3540 [2022-11-02 20:47:20,715 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 51 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 45 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:47:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:23,259 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2022-11-02 20:47:23,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:47:23,259 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 45 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 62 [2022-11-02 20:47:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:23,261 INFO L225 Difference]: With dead ends: 153 [2022-11-02 20:47:23,261 INFO L226 Difference]: Without dead ends: 153 [2022-11-02 20:47:23,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=580, Invalid=6030, Unknown=36, NotChecked=160, Total=6806 [2022-11-02 20:47:23,264 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 527 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:23,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 910 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1110 Invalid, 0 Unknown, 157 Unchecked, 0.8s Time] [2022-11-02 20:47:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-02 20:47:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2022-11-02 20:47:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.288888888888889) internal successors, (116), 106 states have internal predecessors, (116), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:47:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2022-11-02 20:47:23,269 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 62 [2022-11-02 20:47:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:23,270 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2022-11-02 20:47:23,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 45 states have internal predecessors, (103), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:47:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2022-11-02 20:47:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:47:23,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:23,271 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:23,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-02 20:47:23,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-02 20:47:23,483 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:47:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901354, now seen corresponding path program 1 times [2022-11-02 20:47:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:23,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047739784] [2022-11-02 20:47:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:47:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:47:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:47:25,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:25,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047739784] [2022-11-02 20:47:25,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047739784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:25,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882611390] [2022-11-02 20:47:25,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:25,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:25,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:25,394 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:25,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:47:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:25,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-02 20:47:25,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:25,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:25,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:26,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-02 20:47:26,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:47:26,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:26,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-02 20:47:26,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:26,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-02 20:47:26,911 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:47:26,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:47:26,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:47:27,419 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-02 20:47:27,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2022-11-02 20:47:27,445 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-02 20:47:27,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2022-11-02 20:47:27,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:27,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-02 20:47:27,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:27,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-02 20:47:27,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:47:27,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 20:47:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:47:27,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:27,871 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4817 (Array Int Int)) (v_ArrVal_4816 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4817) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4816) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4817 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4817) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:47:27,894 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_4815 Int) (v_ArrVal_4817 (Array Int Int)) (v_ArrVal_4814 Int) (v_ArrVal_4816 (Array Int Int))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_4815)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4817) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_4814)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4816) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4815 Int) (v_ArrVal_4817 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_4815)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_4817) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-02 20:47:42,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882611390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:42,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:47:42,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 47 [2022-11-02 20:47:42,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144654834] [2022-11-02 20:47:42,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:42,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:47:42,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:42,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:47:42,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2769, Unknown=9, NotChecked=214, Total=3192 [2022-11-02 20:47:42,957 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 48 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 42 states have internal predecessors, (96), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:47:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:45,221 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2022-11-02 20:47:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:47:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 42 states have internal predecessors, (96), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 62 [2022-11-02 20:47:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:45,223 INFO L225 Difference]: With dead ends: 138 [2022-11-02 20:47:45,223 INFO L226 Difference]: Without dead ends: 138 [2022-11-02 20:47:45,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=444, Invalid=4955, Unknown=11, NotChecked=290, Total=5700 [2022-11-02 20:47:45,225 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 467 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:45,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 786 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 940 Invalid, 0 Unknown, 52 Unchecked, 0.7s Time] [2022-11-02 20:47:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-02 20:47:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2022-11-02 20:47:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 110 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:47:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-11-02 20:47:45,230 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 62 [2022-11-02 20:47:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:45,231 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-11-02 20:47:45,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 42 states have internal predecessors, (96), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:47:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-11-02 20:47:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:47:45,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:45,232 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:45,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:45,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 20:47:45,439 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:47:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:45,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492107, now seen corresponding path program 1 times [2022-11-02 20:47:45,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:45,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493395758] [2022-11-02 20:47:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:45,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:47,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:47:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:47:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:47,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:47:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:47:48,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:48,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493395758] [2022-11-02 20:47:48,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493395758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:48,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784048064] [2022-11-02 20:47:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:48,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:48,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:48,269 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:48,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:47:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:48,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-02 20:47:48,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:48,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:49,491 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:47:49,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-02 20:47:49,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02 20:47:49,925 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:47:49,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-02 20:47:50,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:50,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2022-11-02 20:47:50,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:47:50,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:47:51,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:51,071 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:47:51,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2022-11-02 20:47:51,098 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:47:51,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:47:51,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:51,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:47:52,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:47:52,664 INFO L356 Elim1Store]: treesize reduction 115, result has 29.4 percent of original size [2022-11-02 20:47:52,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 105 treesize of output 91 [2022-11-02 20:47:52,693 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-02 20:47:52,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 92 [2022-11-02 20:47:52,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:52,870 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:47:52,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 78 [2022-11-02 20:47:52,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:52,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2022-11-02 20:47:53,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2022-11-02 20:47:53,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:53,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-11-02 20:47:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:53,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:53,583 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5114 (Array Int Int)) (v_ArrVal_5115 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5115))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5114) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2022-11-02 20:47:53,592 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5114 (Array Int Int)) (v_ArrVal_5115 (Array Int Int)) (v_ArrVal_5113 Int) (v_ArrVal_5112 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_5112)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5115))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_5113)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5114) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 0))) is different from false [2022-11-02 20:47:55,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784048064] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:55,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:47:55,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2022-11-02 20:47:55,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666653271] [2022-11-02 20:47:55,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:55,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-02 20:47:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:55,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-02 20:47:55,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=5776, Unknown=49, NotChecked=310, Total=6480 [2022-11-02 20:47:55,543 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 68 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 59 states have internal predecessors, (115), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:47:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:59,927 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-11-02 20:47:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:47:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 59 states have internal predecessors, (115), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 65 [2022-11-02 20:47:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:59,929 INFO L225 Difference]: With dead ends: 124 [2022-11-02 20:47:59,929 INFO L226 Difference]: Without dead ends: 124 [2022-11-02 20:47:59,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2155 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=675, Invalid=9788, Unknown=51, NotChecked=406, Total=10920 [2022-11-02 20:47:59,931 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 134 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:59,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1592 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1602 Invalid, 0 Unknown, 138 Unchecked, 1.2s Time] [2022-11-02 20:47:59,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-02 20:47:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-11-02 20:47:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 116 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:47:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2022-11-02 20:47:59,935 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 65 [2022-11-02 20:47:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:59,935 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2022-11-02 20:47:59,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 59 states have internal predecessors, (115), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:47:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2022-11-02 20:47:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:47:59,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:59,937 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:59,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:00,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 20:48:00,150 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:48:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1304596198, now seen corresponding path program 1 times [2022-11-02 20:48:00,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:00,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131869025] [2022-11-02 20:48:00,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:00,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:00,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:48:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:00,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:48:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:00,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:48:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-02 20:48:00,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:00,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131869025] [2022-11-02 20:48:00,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131869025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:00,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:00,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:48:00,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655419356] [2022-11-02 20:48:00,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:00,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:48:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:00,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:48:00,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:48:00,308 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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-02 20:48:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:00,435 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2022-11-02 20:48:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:00,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 68 [2022-11-02 20:48:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:00,436 INFO L225 Difference]: With dead ends: 125 [2022-11-02 20:48:00,436 INFO L226 Difference]: Without dead ends: 125 [2022-11-02 20:48:00,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:48:00,437 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 6 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:00,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 280 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-02 20:48:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-11-02 20:48:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.25) internal successors, (125), 115 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:48:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2022-11-02 20:48:00,442 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 68 [2022-11-02 20:48:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:00,443 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2022-11-02 20:48:00,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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-02 20:48:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2022-11-02 20:48:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:48:00,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:00,444 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:00,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:48:00,444 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:48:00,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:00,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1304640900, now seen corresponding path program 1 times [2022-11-02 20:48:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:00,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714252425] [2022-11-02 20:48:00,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:48:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:48:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:48:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:48:03,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:03,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714252425] [2022-11-02 20:48:03,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714252425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:03,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064011916] [2022-11-02 20:48:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:03,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:03,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:03,462 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:03,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-02 20:48:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:03,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-02 20:48:03,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:03,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:48:04,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:48:04,585 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:48:04,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:48:04,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:48:04,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:48:04,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:04,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:48:05,167 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:05,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-02 20:48:05,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:48:05,702 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:05,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 34 [2022-11-02 20:48:05,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:48:05,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:48:05,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:48:06,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:06,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-02 20:48:06,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:06,212 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-02 20:48:06,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 60 [2022-11-02 20:48:06,231 INFO L356 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-02 20:48:06,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2022-11-02 20:48:06,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:48:06,261 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:48:06,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:48:07,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:07,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:07,739 INFO L356 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-11-02 20:48:07,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 173 treesize of output 82 [2022-11-02 20:48:07,758 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:07,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 102 [2022-11-02 20:48:07,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:48:07,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:07,933 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:48:07,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 81 [2022-11-02 20:48:07,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:07,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-11-02 20:48:07,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:48:08,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:08,093 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:08,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 27 [2022-11-02 20:48:08,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:48:08,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-11-02 20:48:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:08,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:08,391 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (Array Int Int)) (v_ArrVal_5582 (Array Int Int)) (v_ArrVal_5581 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5582) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-02 20:48:08,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (Array Int Int)) (v_ArrVal_5582 (Array Int Int)) (v_ArrVal_5577 (Array Int Int)) (v_ArrVal_5578 Int) (v_ArrVal_5579 (Array Int Int)) (v_ArrVal_5581 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5577) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5582) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_5578)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5579) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:48:08,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (Array Int Int)) (v_ArrVal_5582 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (v_ArrVal_5577 (Array Int Int)) (v_ArrVal_5578 Int) (v_ArrVal_5579 (Array Int Int)) (v_ArrVal_5581 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base|)) (.cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5577) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5582) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (store .cse0 .cse1 v_ArrVal_5578)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5579) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-02 20:48:08,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (Array Int Int)) (v_ArrVal_5582 (Array Int Int)) (v_ArrVal_5577 (Array Int Int)) (v_ArrVal_5578 Int) (v_ArrVal_5579 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_33| Int) (v_ArrVal_5581 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_33| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5577) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5582) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 v_ArrVal_5578)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5579) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-11-02 20:48:08,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (Array Int Int)) (v_ArrVal_5582 (Array Int Int)) (v_ArrVal_5577 (Array Int Int)) (v_ArrVal_5578 Int) (v_ArrVal_5579 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_33| Int) (v_ArrVal_5581 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_33| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5577) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5582) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 v_ArrVal_5578)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5579) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= 0 (select .cse1 .cse2))))))) is different from false [2022-11-02 20:48:08,854 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (Array Int Int)) (v_ArrVal_5582 (Array Int Int)) (v_ArrVal_5577 (Array Int Int)) (v_ArrVal_5578 Int) (v_ArrVal_5579 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_33| Int) (v_ArrVal_5581 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_33| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_5577) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5582) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 v_ArrVal_5578)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5579) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-11-02 20:48:09,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5583 (Array Int Int)) (v_ArrVal_5582 (Array Int Int)) (v_ArrVal_5596 (Array Int Int)) (v_ArrVal_5598 (Array Int Int)) (v_ArrVal_5597 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| Int) (v_ArrVal_5577 (Array Int Int)) (v_ArrVal_5578 Int) (v_ArrVal_5579 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_33| Int) (v_ArrVal_5581 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5598)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5596))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_33| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5597) .cse0 v_ArrVal_5577) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5582) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 v_ArrVal_5578)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5581) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 v_ArrVal_5579) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| v_ArrVal_5583) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_46| |c_#StackHeapBarrier|)) (not (= (select .cse2 .cse3) 0))))))) is different from false [2022-11-02 20:48:09,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064011916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:09,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:48:09,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 65 [2022-11-02 20:48:09,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309850987] [2022-11-02 20:48:09,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:09,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-02 20:48:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-02 20:48:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=4320, Unknown=7, NotChecked=966, Total=5550 [2022-11-02 20:48:09,264 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 65 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 56 states have internal predecessors, (114), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:48:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:18,212 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2022-11-02 20:48:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-02 20:48:18,213 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 56 states have internal predecessors, (114), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2022-11-02 20:48:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:18,214 INFO L225 Difference]: With dead ends: 183 [2022-11-02 20:48:18,214 INFO L226 Difference]: Without dead ends: 183 [2022-11-02 20:48:18,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2239 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=940, Invalid=8981, Unknown=7, NotChecked=1414, Total=11342 [2022-11-02 20:48:18,217 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 729 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:18,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1341 Invalid, 2531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 20:48:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-02 20:48:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 126. [2022-11-02 20:48:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 119 states have internal predecessors, (129), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:48:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2022-11-02 20:48:18,222 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 68 [2022-11-02 20:48:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:18,222 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2022-11-02 20:48:18,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 56 states have internal predecessors, (114), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:48:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2022-11-02 20:48:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-02 20:48:18,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:18,224 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:18,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:18,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 20:48:18,443 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:48:18,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:18,444 INFO L85 PathProgramCache]: Analyzing trace with hash -370531362, now seen corresponding path program 1 times [2022-11-02 20:48:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:18,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855594958] [2022-11-02 20:48:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:20,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:48:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:48:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:48:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:48:21,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:21,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855594958] [2022-11-02 20:48:21,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855594958] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:21,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591550458] [2022-11-02 20:48:21,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:21,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:21,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:21,913 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:21,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-02 20:48:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:22,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 155 conjunts are in the unsatisfiable core [2022-11-02 20:48:22,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:22,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:48:22,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:48:22,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:48:22,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:22,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:48:23,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:48:23,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:48:23,309 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:48:23,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:48:23,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:23,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:48:23,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:48:23,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:48:23,764 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:23,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-11-02 20:48:23,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:48:24,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:24,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 31 [2022-11-02 20:48:24,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:48:24,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:24,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:48:24,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:48:24,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:24,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2022-11-02 20:48:24,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:24,985 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-02 20:48:24,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 61 [2022-11-02 20:48:24,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:24,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:25,009 INFO L356 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-02 20:48:25,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-11-02 20:48:25,040 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:48:25,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:48:26,499 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:26,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 116 [2022-11-02 20:48:26,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:26,527 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-02 20:48:26,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 74 treesize of output 70 [2022-11-02 20:48:26,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:26,725 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:48:26,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 91 [2022-11-02 20:48:26,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:26,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:26,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2022-11-02 20:48:27,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:27,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:27,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:27,641 INFO L356 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2022-11-02 20:48:27,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 60 [2022-11-02 20:48:27,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:27,671 INFO L356 Elim1Store]: treesize reduction 20, result has 25.9 percent of original size [2022-11-02 20:48:27,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 31 [2022-11-02 20:48:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:27,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:28,909 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5888 (Array Int Int)) (v_ArrVal_5887 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5888))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5887))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2))))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5888 (Array Int Int)) (v_ArrVal_5887 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5888))) (or (< (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|) (<= 0 (+ (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5887) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4)) 4)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)))))) is different from false [2022-11-02 20:48:28,943 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5886 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_ArrVal_5888 (Array Int Int)) (v_ArrVal_5887 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5885) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5888))) (or (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5886) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5887))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2))))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5886 (Array Int Int)) (v_ArrVal_5885 (Array Int Int)) (v_ArrVal_5888 (Array Int Int)) (v_ArrVal_5887 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5885) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5888))) (or (<= 0 (+ (select (select .cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_5886) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5887) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_23| 4)) 4)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_23|))))) is different from false [2022-11-02 20:48:31,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591550458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:31,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:48:31,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 68 [2022-11-02 20:48:31,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471684502] [2022-11-02 20:48:31,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:31,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-02 20:48:31,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:31,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-02 20:48:31,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=6393, Unknown=3, NotChecked=322, Total=6972 [2022-11-02 20:48:31,675 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 69 states, 66 states have (on average 1.8636363636363635) internal successors, (123), 59 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:48:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:43,490 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2022-11-02 20:48:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:48:43,490 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 66 states have (on average 1.8636363636363635) internal successors, (123), 59 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2022-11-02 20:48:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:43,491 INFO L225 Difference]: With dead ends: 130 [2022-11-02 20:48:43,491 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 20:48:43,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 110 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1836 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=787, Invalid=11208, Unknown=3, NotChecked=434, Total=12432 [2022-11-02 20:48:43,493 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 447 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 2117 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:43,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1502 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2117 Invalid, 0 Unknown, 331 Unchecked, 2.3s Time] [2022-11-02 20:48:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 20:48:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-02 20:48:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 122 states have internal predecessors, (133), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:48:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2022-11-02 20:48:43,520 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 70 [2022-11-02 20:48:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:43,520 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2022-11-02 20:48:43,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 66 states have (on average 1.8636363636363635) internal successors, (123), 59 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:48:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2022-11-02 20:48:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-02 20:48:43,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:43,522 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:43,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:43,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:43,735 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:48:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash -370531363, now seen corresponding path program 1 times [2022-11-02 20:48:43,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:43,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715348918] [2022-11-02 20:48:43,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:43,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:48:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:48:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:48:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:48:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:47,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715348918] [2022-11-02 20:48:47,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715348918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:47,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548080202] [2022-11-02 20:48:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:47,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:47,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:47,668 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:47,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-02 20:48:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:48,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 121 conjunts are in the unsatisfiable core [2022-11-02 20:48:48,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:48,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:48:48,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:48:48,368 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:48:48,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:48:48,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:48:48,773 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:48:48,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-02 20:48:49,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02 20:48:49,168 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:49,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-02 20:48:49,683 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 20:48:49,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 26 [2022-11-02 20:48:49,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-02 20:48:50,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:50,272 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:48:50,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 73 [2022-11-02 20:48:50,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:50,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2022-11-02 20:48:50,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:50,305 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-02 20:48:50,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2022-11-02 20:48:51,420 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:51,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 109 [2022-11-02 20:48:51,434 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:51,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 95 [2022-11-02 20:48:51,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:51,604 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:48:51,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 84 [2022-11-02 20:48:51,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:51,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2022-11-02 20:48:51,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2022-11-02 20:48:52,144 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-02 20:48:52,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 24 [2022-11-02 20:48:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:48:52,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:52,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6184 (Array Int Int)) (v_ArrVal_6185 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6184))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6185) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-02 20:48:52,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6182 (Array Int Int)) (v_ArrVal_6184 (Array Int Int)) (v_ArrVal_6183 (Array Int Int)) (v_ArrVal_6185 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6183) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6184))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6182) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6185) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-02 20:48:52,497 INFO L356 Elim1Store]: treesize reduction 5, result has 87.5 percent of original size [2022-11-02 20:48:52,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-02 20:48:52,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6182 (Array Int Int)) (v_ArrVal_6184 (Array Int Int)) (v_ArrVal_6183 (Array Int Int)) (v_ArrVal_6185 (Array Int Int))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6183) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6184))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6182) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6185) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-02 20:48:52,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6182 (Array Int Int)) (v_ArrVal_6184 (Array Int Int)) (v_ArrVal_6183 (Array Int Int)) (v_ArrVal_6185 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6183) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6184))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6182) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6185) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_append_#t~mem10#1.base|)) is different from false [2022-11-02 20:48:52,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6182 (Array Int Int)) (v_ArrVal_6184 (Array Int Int)) (v_ArrVal_6183 (Array Int Int)) (v_ArrVal_6185 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6183) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6184))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6182) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6185) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-02 20:48:52,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6182 (Array Int Int)) (v_ArrVal_6184 (Array Int Int)) (v_ArrVal_6183 (Array Int Int)) (v_ArrVal_6185 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4)))) (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6183) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6184))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6182) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6185) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-02 20:48:52,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6182 (Array Int Int)) (v_ArrVal_6184 (Array Int Int)) (v_ArrVal_6183 (Array Int Int)) (v_ArrVal_6185 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6183) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6184))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6182) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6185) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse1))) is different from false [2022-11-02 20:48:52,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6182 (Array Int Int)) (v_ArrVal_6184 (Array Int Int)) (v_ArrVal_6183 (Array Int Int)) (v_ArrVal_6185 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6183) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6184))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6182) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6185) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse1))) is different from false [2022-11-02 20:48:52,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548080202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:52,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:48:52,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33] total 68 [2022-11-02 20:48:52,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368003963] [2022-11-02 20:48:52,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:52,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-02 20:48:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:52,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-02 20:48:52,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5051, Unknown=12, NotChecked=1192, Total=6480 [2022-11-02 20:48:52,906 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 69 states, 66 states have (on average 1.878787878787879) internal successors, (124), 60 states have internal predecessors, (124), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:48:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:58,174 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2022-11-02 20:48:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 20:48:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 66 states have (on average 1.878787878787879) internal successors, (124), 60 states have internal predecessors, (124), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2022-11-02 20:48:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:58,175 INFO L225 Difference]: With dead ends: 147 [2022-11-02 20:48:58,175 INFO L226 Difference]: Without dead ends: 147 [2022-11-02 20:48:58,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=506, Invalid=8444, Unknown=12, NotChecked=1544, Total=10506 [2022-11-02 20:48:58,176 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 231 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:58,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1785 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2601 Invalid, 0 Unknown, 226 Unchecked, 2.0s Time] [2022-11-02 20:48:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-02 20:48:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2022-11-02 20:48:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.233644859813084) internal successors, (132), 122 states have internal predecessors, (132), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:48:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2022-11-02 20:48:58,181 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 70 [2022-11-02 20:48:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:58,181 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2022-11-02 20:48:58,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 66 states have (on average 1.878787878787879) internal successors, (124), 60 states have internal predecessors, (124), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:48:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2022-11-02 20:48:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 20:48:58,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:58,182 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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-02 20:48:58,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:58,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:58,383 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:48:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash 401647952, now seen corresponding path program 1 times [2022-11-02 20:48:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:58,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769872014] [2022-11-02 20:48:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:58,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:49:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:49:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:49:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:49:01,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:01,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769872014] [2022-11-02 20:49:01,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769872014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:01,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709402521] [2022-11-02 20:49:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:01,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:01,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:01,322 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:01,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-02 20:49:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:01,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 143 conjunts are in the unsatisfiable core [2022-11-02 20:49:01,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:01,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:49:01,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:49:02,056 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:49:02,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:49:02,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:49:02,438 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:49:02,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-02 20:49:02,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:49:02,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02 20:49:02,823 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:49:02,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-11-02 20:49:02,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:49:03,337 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:03,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 33 [2022-11-02 20:49:03,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:49:03,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-02 20:49:03,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:03,804 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:49:03,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-02 20:49:04,916 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:49:04,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 87 [2022-11-02 20:49:04,939 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-02 20:49:04,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 39 treesize of output 45 [2022-11-02 20:49:05,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:05,085 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:49:05,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2022-11-02 20:49:05,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:05,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-02 20:49:05,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:05,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 26 [2022-11-02 20:49:05,598 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:49:05,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-02 20:49:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:49:05,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:05,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-11-02 20:49:06,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6481 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_27| Int) (v_ArrVal_6482 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6481))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)) (<= 0 (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_27| 4))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)))) is different from false [2022-11-02 20:49:06,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6479 (Array Int Int)) (v_ArrVal_6481 (Array Int Int)) (v_ArrVal_6480 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_27| Int) (v_ArrVal_6482 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6479) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6481))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_27|) (<= 0 (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6480) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_27| 4)))))) is different from false [2022-11-02 20:49:06,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6479 (Array Int Int)) (v_ArrVal_6481 (Array Int Int)) (v_ArrVal_6480 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_27| Int) (v_ArrVal_6482 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6479) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6481))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_27|) (<= 0 (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6480) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_27| 4)))))) is different from false [2022-11-02 20:49:06,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6479 (Array Int Int)) (v_ArrVal_6481 (Array Int Int)) (v_ArrVal_6480 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_27| Int) (v_ArrVal_6482 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6479) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6481))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)) (<= 0 (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6480) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_27| 4))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_27|))))) is different from false [2022-11-02 20:49:06,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6479 (Array Int Int)) (v_ArrVal_6481 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_27| Int) (v_ArrVal_6480 (Array Int Int)) (v_ArrVal_6482 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6479) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6481))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)) (<= 0 (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6480) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_27| 4))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_27|))))) is different from false [2022-11-02 20:49:06,289 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6479 (Array Int Int)) (v_ArrVal_6481 (Array Int Int)) (v_ArrVal_6480 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_27| Int) (v_ArrVal_6482 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6479) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6481))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_27|) (<= 0 (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6480) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_27| 4))))))) is different from false [2022-11-02 20:49:06,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6479 (Array Int Int)) (v_ArrVal_6481 (Array Int Int)) (v_ArrVal_6480 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_27| Int) (v_ArrVal_6482 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6479) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6481))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)) (<= 0 (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6480) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_27| 4))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_27|))))) is different from false [2022-11-02 20:49:06,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6479 (Array Int Int)) (v_ArrVal_6481 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_27| Int) (v_ArrVal_6480 (Array Int Int)) (v_ArrVal_6482 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6479) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6481))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)) (<= 0 (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6480) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_27| 4))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_27|))))) is different from false [2022-11-02 20:49:06,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6479 (Array Int Int)) (v_ArrVal_6481 (Array Int Int)) (v_ArrVal_6480 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_27| Int) (v_ArrVal_6482 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_6479) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6481))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)) (<= 0 (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_6480) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6482) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_27| 4))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_27|))))) is different from false [2022-11-02 20:49:06,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| Int) (v_ArrVal_6479 (Array Int Int)) (v_ArrVal_6492 (Array Int Int)) (v_ArrVal_6481 (Array Int Int)) (v_ArrVal_6491 (Array Int Int)) (v_ArrVal_6480 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_27| Int) (v_ArrVal_6482 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6491)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6492))) (let ((.cse2 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse0 (store (store .cse3 .cse2 v_ArrVal_6479) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6481))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_27|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55|) 0)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_27|) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| |c_#StackHeapBarrier|)) (<= 0 (select (select .cse0 (select (select (store (store .cse1 .cse2 v_ArrVal_6480) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6482) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_27| 4)))))))) is different from false [2022-11-02 20:49:06,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709402521] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:06,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:49:06,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 33] total 63 [2022-11-02 20:49:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680286098] [2022-11-02 20:49:06,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:06,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-02 20:49:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-02 20:49:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=4693, Unknown=10, NotChecked=1470, Total=6480 [2022-11-02 20:49:06,456 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand has 64 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 55 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:49:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:11,149 INFO L93 Difference]: Finished difference Result 156 states and 172 transitions. [2022-11-02 20:49:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 20:49:11,149 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 55 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 72 [2022-11-02 20:49:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:11,151 INFO L225 Difference]: With dead ends: 156 [2022-11-02 20:49:11,151 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 20:49:11,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1755 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=760, Invalid=7826, Unknown=10, NotChecked=1910, Total=10506 [2022-11-02 20:49:11,152 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 375 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:11,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1647 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2034 Invalid, 0 Unknown, 174 Unchecked, 1.7s Time] [2022-11-02 20:49:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 20:49:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 131. [2022-11-02 20:49:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.238532110091743) internal successors, (135), 124 states have internal predecessors, (135), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:49:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2022-11-02 20:49:11,157 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 72 [2022-11-02 20:49:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:11,158 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2022-11-02 20:49:11,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 55 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:49:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2022-11-02 20:49:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:49:11,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:11,159 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:49:11,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:11,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:11,371 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-02 20:49:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash -563372747, now seen corresponding path program 1 times [2022-11-02 20:49:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:11,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90118047] [2022-11-02 20:49:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:11,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:14,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:49:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:14,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:49:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:49:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:49:15,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:15,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90118047] [2022-11-02 20:49:15,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90118047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:15,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074738650] [2022-11-02 20:49:15,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:15,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:15,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:15,165 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:15,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b2cea93-8ebc-43aa-8601-d9f74dea1fb2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-02 20:49:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:15,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-02 20:49:15,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:15,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:49:16,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:49:16,238 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:49:16,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:49:16,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:49:16,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:49:16,610 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:49:16,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-02 20:49:16,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:49:17,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:17,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2022-11-02 20:49:17,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:49:17,113 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:17,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-02 20:49:17,697 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:49:17,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:49:18,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:18,866 INFO L356 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2022-11-02 20:49:18,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 76 [2022-11-02 20:49:18,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:18,878 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:49:18,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-02 20:49:19,067 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 20:49:19,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 173 [2022-11-02 20:49:19,090 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-02 20:49:19,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 162 [2022-11-02 20:49:19,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:19,939 INFO L356 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2022-11-02 20:49:19,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 109 [2022-11-02 20:49:20,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:20,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:20,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:20,268 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-02 20:49:20,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 110 treesize of output 45 [2022-11-02 20:49:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:20,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:21,132 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6779 (Array Int Int)) (v_ArrVal_6778 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6779))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6778)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (let ((.cse0 (select (select .cse4 .cse2) .cse3))) (or (<= (+ .cse0 1) 0) (not (= (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ .cse0 4)) 0)) (< (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))))) is different from false [2022-11-02 20:49:21,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6775 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6779 (Array Int Int)) (v_ArrVal_6778 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6779))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6775) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6778)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (let ((.cse4 (select (select .cse0 .cse2) .cse3))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (not (= (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ .cse4 4)) 0)) (<= (+ .cse4 1) 0) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))))) is different from false [2022-11-02 20:49:21,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6775 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6779 (Array Int Int)) (v_ArrVal_6778 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base|) (+ |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6779))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6775) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6778)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (<= (+ .cse0 1) 0) (< (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (not (= (select (select .cse2 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)) 0))))))) is different from false [2022-11-02 20:49:21,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6775 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6779 (Array Int Int)) (v_ArrVal_6778 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6779))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6775) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6778)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (or (not (= (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ .cse3 4)) 0)) (<= (+ .cse3 1) 0) (< (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))))))) is different from false [2022-11-02 20:49:21,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6775 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6779 (Array Int Int)) (v_ArrVal_6778 (Array Int Int))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse6))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse6) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6779))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6775) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6778)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (<= (+ .cse0 1) 0) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (< (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (not (= (select (select .cse2 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)) 0))))))))) is different from false [2022-11-02 20:49:21,330 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6775 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6779 (Array Int Int)) (v_ArrVal_6778 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6779))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6775) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6778)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (let ((.cse1 (select (select .cse0 .cse3) .cse4))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (<= (+ .cse1 1) 0) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (not (= (select (select .cse2 (select (select .cse2 .cse3) .cse4)) (+ .cse1 4)) 0))))))))) is different from false [2022-11-02 20:49:21,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6775 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6779 (Array Int Int)) (v_ArrVal_6778 (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6779))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_6775) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6778)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (let ((.cse0 (select (select .cse4 .cse2) .cse3))) (or (<= (+ .cse0 1) 0) (not (= (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ .cse0 4)) 0)) (< (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))))))) is different from false [2022-11-02 20:49:21,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074738650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:21,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:49:21,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36] total 68 [2022-11-02 20:49:21,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618377241] [2022-11-02 20:49:21,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:21,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-02 20:49:21,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-02 20:49:21,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=5475, Unknown=9, NotChecked=1078, Total=6806 [2022-11-02 20:49:21,932 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand has 68 states, 66 states have (on average 1.8636363636363635) internal successors, (123), 59 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)