./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 6b4ec56b 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_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 09:32:22,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:32:22,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:32:22,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:32:22,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:32:22,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:32:22,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:32:22,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:32:22,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:32:22,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:32:22,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:32:22,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:32:22,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:32:22,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:32:22,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:32:22,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:32:22,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:32:22,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:32:22,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:32:22,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:32:22,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:32:22,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:32:22,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:32:22,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:32:22,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:32:22,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:32:22,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:32:22,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:32:22,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:32:22,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:32:22,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:32:22,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:32:22,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:32:22,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:32:22,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:32:22,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:32:22,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:32:22,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:32:22,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:32:22,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:32:22,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:32:22,489 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 09:32:22,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:32:22,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:32:22,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:32:22,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:32:22,528 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:32:22,528 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:32:22,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:32:22,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:32:22,529 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:32:22,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:32:22,530 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:32:22,530 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:32:22,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:32:22,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:32:22,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:32:22,531 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:32:22,531 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:32:22,531 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:32:22,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:32:22,532 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:32:22,532 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:32:22,532 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:32:22,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:32:22,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:32:22,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:32:22,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:32:22,533 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:32:22,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:32:22,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:32:22,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:32:22,534 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_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/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_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN 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-20 09:32:22,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:32:22,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:32:22,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:32:22,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:32:22,836 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:32:22,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-11-20 09:32:25,962 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:32:26,248 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:32:26,249 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-11-20 09:32:26,263 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/data/42ce70a77/d4200b94736249a283bb49cbd9380dae/FLAGb33a7fcd6 [2022-11-20 09:32:26,281 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/data/42ce70a77/d4200b94736249a283bb49cbd9380dae [2022-11-20 09:32:26,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:32:26,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:32:26,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:32:26,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:32:26,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:32:26,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:26,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47434491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26, skipping insertion in model container [2022-11-20 09:32:26,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:26,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:32:26,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:32:26,791 WARN L237 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_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-11-20 09:32:26,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:32:26,804 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:32:26,852 WARN L237 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_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-11-20 09:32:26,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:32:26,884 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:32:26,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26 WrapperNode [2022-11-20 09:32:26,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:32:26,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:32:26,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:32:26,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:32:26,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:26,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:26,972 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-11-20 09:32:26,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:32:26,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:32:26,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:32:26,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:32:26,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:26,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:27,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:27,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:27,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:27,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:27,029 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:27,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:27,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:32:27,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:32:27,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:32:27,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:32:27,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (1/1) ... [2022-11-20 09:32:27,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:32:27,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:27,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:32:27,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:32:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:32:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:32:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 09:32:27,138 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 09:32:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 09:32:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:32:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:32:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 09:32:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 09:32:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:32:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 09:32:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:32:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:32:27,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:32:27,336 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:32:27,338 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:32:27,693 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:32:27,700 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:32:27,700 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 09:32:27,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:32:27 BoogieIcfgContainer [2022-11-20 09:32:27,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:32:27,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:32:27,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:32:27,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:32:27,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:32:26" (1/3) ... [2022-11-20 09:32:27,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c22c8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:32:27, skipping insertion in model container [2022-11-20 09:32:27,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:26" (2/3) ... [2022-11-20 09:32:27,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c22c8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:32:27, skipping insertion in model container [2022-11-20 09:32:27,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:32:27" (3/3) ... [2022-11-20 09:32:27,714 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-11-20 09:32:27,735 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:32:27,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2022-11-20 09:32:27,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:32:27,795 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;@211ee57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:32:27,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2022-11-20 09:32:27,808 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-20 09:32:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 09:32:27,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:27,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:27,817 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-20 09:32:27,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964311, now seen corresponding path program 1 times [2022-11-20 09:32:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:27,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466899290] [2022-11-20 09:32:27,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:28,180 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-20 09:32:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:28,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466899290] [2022-11-20 09:32:28,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466899290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:28,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:28,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:32:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265943104] [2022-11-20 09:32:28,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:28,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:32:28,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:28,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:32:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:32:28,246 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-20 09:32:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:28,486 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-11-20 09:32:28,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:32:28,491 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-20 09:32:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:28,504 INFO L225 Difference]: With dead ends: 105 [2022-11-20 09:32:28,504 INFO L226 Difference]: Without dead ends: 102 [2022-11-20 09:32:28,506 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-20 09:32:28,514 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-20 09:32:28,515 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-20 09:32:28,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-20 09:32:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-20 09:32:28,571 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-20 09:32:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-11-20 09:32:28,578 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 7 [2022-11-20 09:32:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:28,580 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-11-20 09:32:28,580 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-20 09:32:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-11-20 09:32:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 09:32:28,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:28,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:28,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:32:28,583 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-20 09:32:28,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1815964312, now seen corresponding path program 1 times [2022-11-20 09:32:28,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:28,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291405056] [2022-11-20 09:32:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:28,755 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-20 09:32:28,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:28,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291405056] [2022-11-20 09:32:28,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291405056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:28,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:28,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:32:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438832109] [2022-11-20 09:32:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:28,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:32:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:28,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:32:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:32:28,759 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-20 09:32:28,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:28,861 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-11-20 09:32:28,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:32:28,862 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-20 09:32:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:28,863 INFO L225 Difference]: With dead ends: 99 [2022-11-20 09:32:28,863 INFO L226 Difference]: Without dead ends: 99 [2022-11-20 09:32:28,863 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-20 09:32:28,865 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-20 09:32:28,866 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-20 09:32:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-20 09:32:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-20 09:32:28,873 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-20 09:32:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-20 09:32:28,877 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 7 [2022-11-20 09:32:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:28,877 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-20 09:32:28,877 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-20 09:32:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-20 09:32:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:32:28,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:28,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:28,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:32:28,879 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-20 09:32:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash -418267899, now seen corresponding path program 1 times [2022-11-20 09:32:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:28,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091719406] [2022-11-20 09:32:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:28,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:29,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:29,426 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-20 09:32:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:29,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091719406] [2022-11-20 09:32:29,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091719406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:29,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:29,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:32:29,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212467198] [2022-11-20 09:32:29,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:29,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:32:29,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:29,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:32:29,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:32:29,431 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-20 09:32:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:29,852 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-11-20 09:32:29,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:32:29,853 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-20 09:32:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:29,860 INFO L225 Difference]: With dead ends: 102 [2022-11-20 09:32:29,860 INFO L226 Difference]: Without dead ends: 102 [2022-11-20 09:32:29,865 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-20 09:32:29,868 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 20 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:29,869 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.4s Time] [2022-11-20 09:32:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-20 09:32:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2022-11-20 09:32:29,887 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-20 09:32:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-11-20 09:32:29,898 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 14 [2022-11-20 09:32:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:29,899 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-11-20 09:32:29,899 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-20 09:32:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-11-20 09:32:29,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:32:29,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:29,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:29,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:32:29,902 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-20 09:32:29,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:29,904 INFO L85 PathProgramCache]: Analyzing trace with hash -418267900, now seen corresponding path program 1 times [2022-11-20 09:32:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:29,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677699857] [2022-11-20 09:32:29,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:29,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:30,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:30,128 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-20 09:32:30,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:30,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677699857] [2022-11-20 09:32:30,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677699857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:30,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:30,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:32:30,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110687989] [2022-11-20 09:32:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:30,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:32:30,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:30,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:32:30,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:32:30,135 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-20 09:32:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:30,389 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-11-20 09:32:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:32:30,389 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-20 09:32:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:30,390 INFO L225 Difference]: With dead ends: 100 [2022-11-20 09:32:30,391 INFO L226 Difference]: Without dead ends: 100 [2022-11-20 09:32:30,391 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-20 09:32:30,392 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-20 09:32:30,393 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-20 09:32:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-20 09:32:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-11-20 09:32:30,398 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-20 09:32:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-11-20 09:32:30,400 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 14 [2022-11-20 09:32:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:30,400 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-11-20 09:32:30,400 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-20 09:32:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-11-20 09:32:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:32:30,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:30,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:30,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:32:30,402 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-20 09:32:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1186059880, now seen corresponding path program 1 times [2022-11-20 09:32:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:30,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639968556] [2022-11-20 09:32:30,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:30,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 09:32:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:30,494 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-20 09:32:30,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:30,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639968556] [2022-11-20 09:32:30,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639968556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:30,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:30,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:32:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92875610] [2022-11-20 09:32:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:30,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:32:30,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:30,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:32:30,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:32:30,498 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-20 09:32:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:30,630 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-11-20 09:32:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:32:30,631 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-20 09:32:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:30,632 INFO L225 Difference]: With dead ends: 105 [2022-11-20 09:32:30,632 INFO L226 Difference]: Without dead ends: 105 [2022-11-20 09:32:30,632 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-20 09:32:30,633 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-20 09:32:30,634 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-20 09:32:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-20 09:32:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2022-11-20 09:32:30,639 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-20 09:32:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-11-20 09:32:30,641 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 16 [2022-11-20 09:32:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:30,641 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-11-20 09:32:30,642 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-20 09:32:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-11-20 09:32:30,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 09:32:30,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:30,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:30,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:32:30,643 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-20 09:32:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:30,644 INFO L85 PathProgramCache]: Analyzing trace with hash -918895952, now seen corresponding path program 1 times [2022-11-20 09:32:30,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:30,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047929129] [2022-11-20 09:32:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:30,729 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-20 09:32:30,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:30,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047929129] [2022-11-20 09:32:30,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047929129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:30,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:30,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:32:30,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065037628] [2022-11-20 09:32:30,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:30,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:32:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:30,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:32:30,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:32:30,733 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-20 09:32:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:30,858 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-20 09:32:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:32:30,859 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-20 09:32:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:30,860 INFO L225 Difference]: With dead ends: 102 [2022-11-20 09:32:30,860 INFO L226 Difference]: Without dead ends: 102 [2022-11-20 09:32:30,860 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-20 09:32:30,861 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-20 09:32:30,861 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-20 09:32:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-20 09:32:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-11-20 09:32:30,865 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-20 09:32:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-11-20 09:32:30,866 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 17 [2022-11-20 09:32:30,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:30,867 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-11-20 09:32:30,867 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-20 09:32:30,867 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-11-20 09:32:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 09:32:30,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:30,868 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-20 09:32:30,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:32:30,868 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-20 09:32:30,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1802773707, now seen corresponding path program 1 times [2022-11-20 09:32:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:30,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261868816] [2022-11-20 09:32:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:30,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:30,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:30,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 09:32:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:31,012 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-20 09:32:31,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:31,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261868816] [2022-11-20 09:32:31,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261868816] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:31,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258056266] [2022-11-20 09:32:31,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:31,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:31,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:31,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:31,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 09:32:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:31,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:32:31,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:31,251 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-20 09:32:31,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:31,322 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-20 09:32:31,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258056266] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:32:31,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:32:31,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-20 09:32:31,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71621040] [2022-11-20 09:32:31,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:31,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:32:31,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:31,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:32:31,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:32:31,325 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-20 09:32:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:31,442 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-11-20 09:32:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:32:31,443 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-20 09:32:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:31,444 INFO L225 Difference]: With dead ends: 103 [2022-11-20 09:32:31,444 INFO L226 Difference]: Without dead ends: 103 [2022-11-20 09:32:31,444 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-20 09:32:31,445 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-20 09:32:31,445 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-20 09:32:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-20 09:32:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-20 09:32:31,449 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-20 09:32:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-11-20 09:32:31,450 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 31 [2022-11-20 09:32:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:31,451 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-11-20 09:32:31,451 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-20 09:32:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-11-20 09:32:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 09:32:31,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:31,452 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-20 09:32:31,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:31,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:31,658 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-20 09:32:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash 916543363, now seen corresponding path program 1 times [2022-11-20 09:32:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:31,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138406335] [2022-11-20 09:32:31,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:31,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:31,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:31,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:32,102 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-20 09:32:32,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:32,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138406335] [2022-11-20 09:32:32,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138406335] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:32,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839483554] [2022-11-20 09:32:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:32,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:32,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:32,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:32,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 09:32:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:32,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 09:32:32,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:32,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:32:32,412 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_510 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_510))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 09:32:32,508 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:32:32,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:32:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 09:32:32,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:32,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839483554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:32,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:32:32,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-11-20 09:32:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778399967] [2022-11-20 09:32:32,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:32,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 09:32:32,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:32,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 09:32:32,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2022-11-20 09:32:32,594 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-20 09:32:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:32,989 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-11-20 09:32:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:32:32,990 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-20 09:32:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:32,991 INFO L225 Difference]: With dead ends: 114 [2022-11-20 09:32:32,991 INFO L226 Difference]: Without dead ends: 114 [2022-11-20 09:32:32,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2022-11-20 09:32:32,992 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 172 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:32,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 329 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 376 Invalid, 0 Unknown, 117 Unchecked, 0.3s Time] [2022-11-20 09:32:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-20 09:32:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-11-20 09:32:32,996 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-20 09:32:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2022-11-20 09:32:32,997 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 32 [2022-11-20 09:32:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:32,997 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2022-11-20 09:32:32,997 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-20 09:32:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-11-20 09:32:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 09:32:32,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:32,998 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-20 09:32:33,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:33,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:33,205 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-20 09:32:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:33,206 INFO L85 PathProgramCache]: Analyzing trace with hash 916543364, now seen corresponding path program 1 times [2022-11-20 09:32:33,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:33,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804707694] [2022-11-20 09:32:33,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:33,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:33,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:33,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:33,923 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-20 09:32:33,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804707694] [2022-11-20 09:32:33,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804707694] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786714276] [2022-11-20 09:32:33,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:33,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:33,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:33,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:33,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 09:32:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:34,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 09:32:34,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:34,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:32:34,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:32:34,337 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 09:32:34,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:34,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:32:34,435 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:32:34,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:32:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 09:32:34,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:36,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786714276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:36,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:32:36,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 14 [2022-11-20 09:32:36,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798906084] [2022-11-20 09:32:36,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:36,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 09:32:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:36,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 09:32:36,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2022-11-20 09:32:36,650 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-20 09:32:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:37,264 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-20 09:32:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:32:37,265 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-20 09:32:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:37,265 INFO L225 Difference]: With dead ends: 102 [2022-11-20 09:32:37,266 INFO L226 Difference]: Without dead ends: 102 [2022-11-20 09:32:37,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=76, Invalid=347, Unknown=1, NotChecked=38, Total=462 [2022-11-20 09:32:37,267 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 108 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:37,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 344 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 508 Invalid, 0 Unknown, 104 Unchecked, 0.4s Time] [2022-11-20 09:32:37,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-20 09:32:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-11-20 09:32:37,270 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-20 09:32:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-11-20 09:32:37,271 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 32 [2022-11-20 09:32:37,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:37,271 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-11-20 09:32:37,272 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-20 09:32:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-11-20 09:32:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 09:32:37,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:37,273 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-20 09:32:37,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:37,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:37,479 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-20 09:32:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2135424312, now seen corresponding path program 2 times [2022-11-20 09:32:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:37,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385073151] [2022-11-20 09:32:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-20 09:32:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:37,785 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-20 09:32:37,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385073151] [2022-11-20 09:32:37,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385073151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289638792] [2022-11-20 09:32:37,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:32:37,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:37,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:37,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:37,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 09:32:38,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:32:38,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:32:38,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 09:32:38,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:38,096 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-20 09:32:38,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:38,210 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-20 09:32:38,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289638792] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:32:38,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:32:38,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-11-20 09:32:38,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645533609] [2022-11-20 09:32:38,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:38,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:32:38,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:38,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:32:38,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:32:38,213 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-20 09:32:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:38,423 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2022-11-20 09:32:38,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:32:38,424 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-20 09:32:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:38,424 INFO L225 Difference]: With dead ends: 101 [2022-11-20 09:32:38,425 INFO L226 Difference]: Without dead ends: 101 [2022-11-20 09:32:38,425 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-20 09:32:38,425 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-20 09:32:38,426 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-20 09:32:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-20 09:32:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-20 09:32:38,428 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-20 09:32:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-11-20 09:32:38,429 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 46 [2022-11-20 09:32:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:38,429 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-11-20 09:32:38,430 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-20 09:32:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-11-20 09:32:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 09:32:38,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:38,431 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-20 09:32:38,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:38,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 09:32:38,632 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-20 09:32:38,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:38,632 INFO L85 PathProgramCache]: Analyzing trace with hash 568631680, now seen corresponding path program 1 times [2022-11-20 09:32:38,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:38,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091617964] [2022-11-20 09:32:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:39,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:32:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:39,304 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-20 09:32:39,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:39,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091617964] [2022-11-20 09:32:39,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091617964] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:39,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658717342] [2022-11-20 09:32:39,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:39,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:39,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:39,306 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:39,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 09:32:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:39,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 09:32:39,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:39,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:32:39,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:32:39,597 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1169 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1169))))) is different from true [2022-11-20 09:32:39,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:39,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:32:39,700 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-20 09:32:39,738 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:32:39,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:32:39,801 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:32:39,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:32:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 14 not checked. [2022-11-20 09:32:39,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:40,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658717342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:40,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:32:40,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2022-11-20 09:32:40,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946976707] [2022-11-20 09:32:40,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:40,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 09:32:40,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:40,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 09:32:40,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=2, NotChecked=46, Total=210 [2022-11-20 09:32:40,151 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), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 09:32:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:40,762 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-11-20 09:32:40,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:32:40,762 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-11-20 09:32:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:40,763 INFO L225 Difference]: With dead ends: 109 [2022-11-20 09:32:40,763 INFO L226 Difference]: Without dead ends: 109 [2022-11-20 09:32:40,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=213, Unknown=2, NotChecked=62, Total=342 [2022-11-20 09:32:40,764 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 117 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:40,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 352 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 340 Invalid, 0 Unknown, 211 Unchecked, 0.4s Time] [2022-11-20 09:32:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-20 09:32:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2022-11-20 09:32:40,767 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-20 09:32:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-11-20 09:32:40,768 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 47 [2022-11-20 09:32:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:40,768 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-11-20 09:32:40,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 09:32:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-11-20 09:32:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 09:32:40,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:40,769 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-20 09:32:40,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:40,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:40,970 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-20 09:32:40,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash 568631681, now seen corresponding path program 1 times [2022-11-20 09:32:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:40,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744309568] [2022-11-20 09:32:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:40,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:41,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:41,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:32:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:41,770 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-20 09:32:41,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:41,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744309568] [2022-11-20 09:32:41,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744309568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:41,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260861530] [2022-11-20 09:32:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:41,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:41,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:41,775 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:41,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 09:32:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:42,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 09:32:42,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:42,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:32:42,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:32:42,083 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1422 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1422) |c_#length|)))) is different from true [2022-11-20 09:32:42,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:42,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:32:42,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:32:42,193 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1423 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1423))))) is different from true [2022-11-20 09:32:42,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:42,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:32:42,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:32:42,323 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1424 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1424))))) is different from true [2022-11-20 09:32:42,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:42,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:32:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 21 not checked. [2022-11-20 09:32:42,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:42,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260861530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:42,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:32:42,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-20 09:32:42,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305317200] [2022-11-20 09:32:42,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:42,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 09:32:42,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:42,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 09:32:42,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-11-20 09:32:42,487 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 09:32:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:42,961 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-11-20 09:32:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:32:42,962 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-11-20 09:32:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:42,963 INFO L225 Difference]: With dead ends: 104 [2022-11-20 09:32:42,963 INFO L226 Difference]: Without dead ends: 104 [2022-11-20 09:32:42,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-11-20 09:32:42,964 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 254 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:42,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 228 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 321 Invalid, 0 Unknown, 306 Unchecked, 0.4s Time] [2022-11-20 09:32:42,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-20 09:32:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2022-11-20 09:32:42,966 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-20 09:32:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-11-20 09:32:42,967 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 47 [2022-11-20 09:32:42,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:42,967 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-11-20 09:32:42,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 09:32:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-11-20 09:32:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 09:32:42,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:42,968 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-20 09:32:42,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:43,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:43,169 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-20 09:32:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985862, now seen corresponding path program 1 times [2022-11-20 09:32:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:43,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98038424] [2022-11-20 09:32:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:43,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:43,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:43,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:43,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:32:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:44,145 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-20 09:32:44,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:44,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98038424] [2022-11-20 09:32:44,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98038424] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:44,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746967836] [2022-11-20 09:32:44,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:44,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:44,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:44,147 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:44,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 09:32:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:44,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 09:32:44,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:44,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:32:44,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-20 09:32:44,938 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1676 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1676) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-20 09:32:44,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:44,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 09:32:44,985 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-20 09:32:44,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 09:32:45,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 09:32:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-20 09:32:45,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:45,199 WARN L837 $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-20 09:32:45,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746967836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:45,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:32:45,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-11-20 09:32:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606501698] [2022-11-20 09:32:45,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:45,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 09:32:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 09:32:45,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=623, Unknown=3, NotChecked=102, Total=812 [2022-11-20 09:32:45,203 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-20 09:32:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:46,274 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-11-20 09:32:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 09:32:46,275 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-20 09:32:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:46,276 INFO L225 Difference]: With dead ends: 133 [2022-11-20 09:32:46,276 INFO L226 Difference]: Without dead ends: 133 [2022-11-20 09:32:46,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=135, Invalid=924, Unknown=5, NotChecked=126, Total=1190 [2022-11-20 09:32:46,277 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 74 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:46,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1139 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 918 Invalid, 0 Unknown, 160 Unchecked, 0.8s Time] [2022-11-20 09:32:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-20 09:32:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 91. [2022-11-20 09:32:46,281 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-20 09:32:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-11-20 09:32:46,282 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 51 [2022-11-20 09:32:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:46,283 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-11-20 09:32:46,283 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-20 09:32:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-11-20 09:32:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 09:32:46,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:46,285 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-20 09:32:46,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:46,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 09:32:46,485 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-20 09:32:46,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1941985863, now seen corresponding path program 1 times [2022-11-20 09:32:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:46,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354970609] [2022-11-20 09:32:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:47,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:47,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:32:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:48,179 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-20 09:32:48,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:48,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354970609] [2022-11-20 09:32:48,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354970609] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:48,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423205099] [2022-11-20 09:32:48,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:48,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:48,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:48,183 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:48,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 09:32:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:48,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-20 09:32:48,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:48,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:32:49,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-20 09:32:49,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 09:32:49,390 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1934 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1934))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1933 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1933) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1928 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1928) |c_#length|)))) is different from true [2022-11-20 09:32:49,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:49,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:32:49,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:49,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 09:32:49,461 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 09:32:49,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-20 09:32:49,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 09:32:49,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 09:32:49,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 09:32:49,706 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-20 09:32:49,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:50,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423205099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:50,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:32:50,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2022-11-20 09:32:50,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474979998] [2022-11-20 09:32:50,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:50,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 09:32:50,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:50,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 09:32:50,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1158, Unknown=2, NotChecked=68, Total=1332 [2022-11-20 09:32:50,848 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-20 09:32:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:53,480 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2022-11-20 09:32:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:32:53,481 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-20 09:32:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:53,482 INFO L225 Difference]: With dead ends: 141 [2022-11-20 09:32:53,482 INFO L226 Difference]: Without dead ends: 141 [2022-11-20 09:32:53,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=210, Invalid=2045, Unknown=5, NotChecked=92, Total=2352 [2022-11-20 09:32:53,484 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 266 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:53,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1736 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1372 Invalid, 0 Unknown, 189 Unchecked, 1.5s Time] [2022-11-20 09:32:53,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-20 09:32:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2022-11-20 09:32:53,487 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-20 09:32:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-11-20 09:32:53,487 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 51 [2022-11-20 09:32:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:53,488 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-11-20 09:32:53,488 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-20 09:32:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-11-20 09:32:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 09:32:53,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:53,489 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-20 09:32:53,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:53,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 09:32:53,697 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-20 09:32:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:53,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1941832962, now seen corresponding path program 1 times [2022-11-20 09:32:53,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:53,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431135875] [2022-11-20 09:32:53,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:53,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:53,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:53,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:53,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:32:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:53,880 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-20 09:32:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:53,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431135875] [2022-11-20 09:32:53,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431135875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:53,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:53,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:32:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928524604] [2022-11-20 09:32:53,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:53,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:32:53,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:53,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:32:53,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:32:53,883 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-20 09:32:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:54,001 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-11-20 09:32:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:32:54,002 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-20 09:32:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:54,002 INFO L225 Difference]: With dead ends: 105 [2022-11-20 09:32:54,002 INFO L226 Difference]: Without dead ends: 105 [2022-11-20 09:32:54,003 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-20 09:32:54,003 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 137 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:54,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 157 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:32:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-20 09:32:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2022-11-20 09:32:54,006 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-20 09:32:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-11-20 09:32:54,007 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 51 [2022-11-20 09:32:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:54,007 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-11-20 09:32:54,008 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-20 09:32:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-11-20 09:32:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 09:32:54,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:54,008 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-20 09:32:54,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:32:54,009 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-20 09:32:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671715, now seen corresponding path program 1 times [2022-11-20 09:32:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:54,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753300852] [2022-11-20 09:32:54,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:54,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:54,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:32:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:54,400 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-20 09:32:54,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:54,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753300852] [2022-11-20 09:32:54,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753300852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:54,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:54,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 09:32:54,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431135796] [2022-11-20 09:32:54,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:54,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 09:32:54,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:54,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 09:32:54,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:32:54,403 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-20 09:32:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:54,770 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-11-20 09:32:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 09:32:54,770 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-20 09:32:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:54,772 INFO L225 Difference]: With dead ends: 141 [2022-11-20 09:32:54,772 INFO L226 Difference]: Without dead ends: 141 [2022-11-20 09:32:54,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-20 09:32:54,773 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 225 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:54,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 356 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:32:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-20 09:32:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2022-11-20 09:32:54,775 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-20 09:32:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2022-11-20 09:32:54,776 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 53 [2022-11-20 09:32:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:54,776 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2022-11-20 09:32:54,777 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-20 09:32:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2022-11-20 09:32:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 09:32:54,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:54,777 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-20 09:32:54,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:32:54,778 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-20 09:32:54,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2085671716, now seen corresponding path program 1 times [2022-11-20 09:32:54,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:54,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016051334] [2022-11-20 09:32:54,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:32:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:55,441 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-20 09:32:55,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:55,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016051334] [2022-11-20 09:32:55,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016051334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:55,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:55,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 09:32:55,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233809369] [2022-11-20 09:32:55,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:55,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 09:32:55,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:55,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 09:32:55,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:32:55,445 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-20 09:32:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:55,860 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2022-11-20 09:32:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 09:32:55,862 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-20 09:32:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:55,863 INFO L225 Difference]: With dead ends: 151 [2022-11-20 09:32:55,863 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 09:32:55,863 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-20 09:32:55,864 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 194 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:55,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 398 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:32:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 09:32:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 100. [2022-11-20 09:32:55,867 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-20 09:32:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-11-20 09:32:55,867 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-11-20 09:32:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:55,868 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-11-20 09:32:55,868 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-20 09:32:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-11-20 09:32:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 09:32:55,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:55,868 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-20 09:32:55,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:32:55,869 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-20 09:32:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352068, now seen corresponding path program 1 times [2022-11-20 09:32:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:55,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853886294] [2022-11-20 09:32:55,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:55,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:57,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:32:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:57,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:32:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:32:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:58,471 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-20 09:32:58,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:58,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853886294] [2022-11-20 09:32:58,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853886294] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:58,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960312502] [2022-11-20 09:32:58,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:58,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:58,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:58,472 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:58,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 09:32:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:58,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-20 09:32:58,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:58,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:32:59,198 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:32:59,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:32:59,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:32:59,471 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:32:59,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-20 09:32:59,804 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-20 09:32:59,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 33 [2022-11-20 09:32:59,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 09:32:59,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:33:00,112 WARN L859 $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-20 09:33:00,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:00,177 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:33:00,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-11-20 09:33:00,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:00,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-11-20 09:33:00,251 INFO L321 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2022-11-20 09:33:00,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2022-11-20 09:33:00,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-11-20 09:33:00,583 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-20 09:33:00,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2022-11-20 09:33:00,738 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-20 09:33:00,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:01,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960312502] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:01,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:33:01,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-11-20 09:33:01,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862972150] [2022-11-20 09:33:01,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:33:01,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-20 09:33:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:01,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-20 09:33:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2366, Unknown=1, NotChecked=98, Total=2652 [2022-11-20 09:33:01,138 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-20 09:33:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:03,322 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2022-11-20 09:33:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 09:33:03,322 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-20 09:33:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:03,323 INFO L225 Difference]: With dead ends: 103 [2022-11-20 09:33:03,324 INFO L226 Difference]: Without dead ends: 103 [2022-11-20 09:33:03,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=338, Invalid=3697, Unknown=1, NotChecked=124, Total=4160 [2022-11-20 09:33:03,325 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 80 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:03,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1145 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1028 Invalid, 0 Unknown, 177 Unchecked, 1.1s Time] [2022-11-20 09:33:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-20 09:33:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2022-11-20 09:33:03,330 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-20 09:33:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2022-11-20 09:33:03,330 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 55 [2022-11-20 09:33:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:03,331 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2022-11-20 09:33:03,331 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-20 09:33:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2022-11-20 09:33:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 09:33:03,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:03,332 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-20 09:33:03,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-20 09:33:03,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 09:33:03,547 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-20 09:33:03,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1947352067, now seen corresponding path program 1 times [2022-11-20 09:33:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:03,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373084536] [2022-11-20 09:33:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:05,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:33:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:05,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:33:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:33:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:07,653 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-20 09:33:07,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:07,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373084536] [2022-11-20 09:33:07,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373084536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:07,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265821908] [2022-11-20 09:33:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:07,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:07,663 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:07,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 09:33:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:07,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-20 09:33:07,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:08,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:33:08,621 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:33:08,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:33:08,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:33:08,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:33:09,006 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:33:09,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2022-11-20 09:33:09,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-11-20 09:33:09,541 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 09:33:09,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 48 [2022-11-20 09:33:09,559 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 09:33:09,560 INFO L350 Elim1Store]: Elim1 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-20 09:33:09,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:33:09,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:33:09,960 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2948 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2948))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2943 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2943) |c_#length|)) (exists ((v_ArrVal_2949 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2949))))) is different from true [2022-11-20 09:33:10,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:10,032 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:33:10,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 97 [2022-11-20 09:33:10,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:10,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:10,047 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 09:33:10,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 91 [2022-11-20 09:33:10,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:10,060 INFO L350 Elim1Store]: Elim1 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-20 09:33:10,087 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-20 09:33:10,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 09:33:10,497 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 09:33:10,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 54 [2022-11-20 09:33:10,512 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 09:33:10,512 INFO L350 Elim1Store]: Elim1 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-20 09:33:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 09:33:10,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:11,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265821908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:11,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:33:11,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-11-20 09:33:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121307423] [2022-11-20 09:33:11,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:33:11,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 09:33:11,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 09:33:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3014, Unknown=2, NotChecked=110, Total=3306 [2022-11-20 09:33:11,329 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-20 09:33:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:16,418 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2022-11-20 09:33:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 09:33:16,418 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-20 09:33:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:16,420 INFO L225 Difference]: With dead ends: 196 [2022-11-20 09:33:16,420 INFO L226 Difference]: Without dead ends: 196 [2022-11-20 09:33:16,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=439, Invalid=5113, Unknown=2, NotChecked=146, Total=5700 [2022-11-20 09:33:16,422 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 605 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 434 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:16,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1958 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2478 Invalid, 0 Unknown, 434 Unchecked, 2.4s Time] [2022-11-20 09:33:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-20 09:33:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 104. [2022-11-20 09:33:16,426 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-20 09:33:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-11-20 09:33:16,427 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 55 [2022-11-20 09:33:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:16,427 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-11-20 09:33:16,428 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-20 09:33:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-11-20 09:33:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 09:33:16,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:16,429 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-20 09:33:16,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 09:33:16,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:16,636 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-20 09:33:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1045714181, now seen corresponding path program 1 times [2022-11-20 09:33:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647257549] [2022-11-20 09:33:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:17,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:33:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:17,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:33:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:17,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:33:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:17,314 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-20 09:33:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:17,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647257549] [2022-11-20 09:33:17,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647257549] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:17,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453470473] [2022-11-20 09:33:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:17,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:17,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:17,319 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:17,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 09:33:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:17,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-20 09:33:17,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:18,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 09:33:18,298 WARN L859 $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-20 09:33:18,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:18,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-20 09:33:18,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 09:33:18,427 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-20 09:33:18,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:18,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453470473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:18,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:33:18,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-20 09:33:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238608413] [2022-11-20 09:33:18,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:33:18,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 09:33:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 09:33:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=616, Unknown=3, NotChecked=50, Total=756 [2022-11-20 09:33:18,642 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-20 09:33:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:19,695 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-11-20 09:33:19,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:33:19,696 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-20 09:33:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:19,697 INFO L225 Difference]: With dead ends: 92 [2022-11-20 09:33:19,697 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 09:33:19,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=176, Invalid=1015, Unknown=3, NotChecked=66, Total=1260 [2022-11-20 09:33:19,698 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 404 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:19,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 695 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 567 Invalid, 0 Unknown, 87 Unchecked, 0.6s Time] [2022-11-20 09:33:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 09:33:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-20 09:33:19,703 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-20 09:33:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-11-20 09:33:19,703 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 56 [2022-11-20 09:33:19,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:19,704 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-11-20 09:33:19,704 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-20 09:33:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-11-20 09:33:19,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 09:33:19,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:19,705 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-20 09:33:19,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 09:33:19,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:19,913 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-20 09:33:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343071, now seen corresponding path program 1 times [2022-11-20 09:33:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:19,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730549811] [2022-11-20 09:33:19,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:19,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:20,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:33:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:20,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:33:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:20,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:33:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:21,084 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-20 09:33:21,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:21,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730549811] [2022-11-20 09:33:21,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730549811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:21,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:21,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-20 09:33:21,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488302603] [2022-11-20 09:33:21,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:21,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 09:33:21,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:21,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 09:33:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-11-20 09:33:21,086 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-20 09:33:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:22,420 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2022-11-20 09:33:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 09:33:22,420 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-20 09:33:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:22,421 INFO L225 Difference]: With dead ends: 157 [2022-11-20 09:33:22,421 INFO L226 Difference]: Without dead ends: 157 [2022-11-20 09:33:22,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2022-11-20 09:33:22,423 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 804 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:22,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 488 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 09:33:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-20 09:33:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 98. [2022-11-20 09:33:22,427 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-20 09:33:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-11-20 09:33:22,428 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 58 [2022-11-20 09:33:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:22,429 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-11-20 09:33:22,429 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-20 09:33:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-11-20 09:33:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 09:33:22,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:22,430 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-20 09:33:22,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 09:33:22,431 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-20 09:33:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:22,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1285343072, now seen corresponding path program 1 times [2022-11-20 09:33:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:22,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100523735] [2022-11-20 09:33:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:23,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:33:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:23,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:33:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:33:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:24,411 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-20 09:33:24,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:24,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100523735] [2022-11-20 09:33:24,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100523735] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:24,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568125212] [2022-11-20 09:33:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:24,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:24,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:24,413 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:24,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 09:33:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:24,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-20 09:33:24,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:24,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:33:24,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:33:25,005 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:33:25,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:33:25,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:33:25,360 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:33:25,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:33:25,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 09:33:25,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 09:33:26,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:26,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2022-11-20 09:33:26,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:26,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-20 09:33:26,533 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:33:26,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-20 09:33:26,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-20 09:33:26,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:26,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-11-20 09:33:26,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:26,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-20 09:33:26,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-20 09:33:26,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-20 09:33:26,779 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-20 09:33:26,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:27,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:33:27,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2022-11-20 09:33:27,496 WARN L837 $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-20 09:33:27,526 WARN L837 $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-20 09:33:27,552 WARN L837 $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-20 09:33:27,611 WARN L837 $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-20 09:33:27,728 WARN L837 $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-20 09:33:27,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568125212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:27,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:33:27,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 44 [2022-11-20 09:33:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800550543] [2022-11-20 09:33:27,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:33:27,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 09:33:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:27,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 09:33:27,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2286, Unknown=26, NotChecked=500, Total=2970 [2022-11-20 09:33:27,735 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-20 09:33:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:30,877 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2022-11-20 09:33:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 09:33:30,877 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-20 09:33:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:30,879 INFO L225 Difference]: With dead ends: 192 [2022-11-20 09:33:30,879 INFO L226 Difference]: Without dead ends: 192 [2022-11-20 09:33:30,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=543, Invalid=4281, Unknown=26, NotChecked=700, Total=5550 [2022-11-20 09:33:30,881 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1508 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:30,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 925 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 09:33:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-20 09:33:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 105. [2022-11-20 09:33:30,885 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-20 09:33:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-20 09:33:30,886 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 58 [2022-11-20 09:33:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:30,886 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-20 09:33:30,887 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-20 09:33:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-20 09:33:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-20 09:33:30,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:30,888 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-20 09:33:30,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-20 09:33:31,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 09:33:31,094 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-20 09:33:31,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:31,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1757191502, now seen corresponding path program 2 times [2022-11-20 09:33:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:31,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121140931] [2022-11-20 09:33:31,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:33,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:33:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:33,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:33:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:34,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:33:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:35,492 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-20 09:33:35,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:35,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121140931] [2022-11-20 09:33:35,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121140931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:35,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574272443] [2022-11-20 09:33:35,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:33:35,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:35,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:35,494 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:35,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 09:33:35,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:33:35,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:33:35,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-20 09:33:35,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:35,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:33:36,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:33:36,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:33:36,997 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:33:36,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:33:37,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:33:37,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:33:37,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:33:37,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:33:37,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 09:33:37,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 09:33:37,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:37,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:37,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:33:37,519 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 09:33:37,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 73 [2022-11-20 09:33:37,541 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-20 09:33:37,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-11-20 09:33:38,161 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 09:33:38,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 38 [2022-11-20 09:33:38,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:33:38,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:33:38,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 09:33:38,458 WARN L859 $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-20 09:33:38,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:38,529 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-20 09:33:38,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 76 [2022-11-20 09:33:38,551 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 09:33:38,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 09:33:38,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:38,562 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-20 09:33:38,562 INFO L350 Elim1Store]: Elim1 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-20 09:33:39,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:39,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:33:39,464 INFO L321 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-11-20 09:33:39,464 INFO L350 Elim1Store]: Elim1 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-20 09:33:39,485 INFO L321 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2022-11-20 09:33:39,486 INFO L350 Elim1Store]: Elim1 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-20 09:33:39,569 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-20 09:33:39,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:40,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574272443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:40,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:33:40,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 56 [2022-11-20 09:33:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154526789] [2022-11-20 09:33:40,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:33:40,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-20 09:33:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:40,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-20 09:33:40,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3483, Unknown=3, NotChecked=118, Total=3782 [2022-11-20 09:33:40,396 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-20 09:33:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:43,639 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-11-20 09:33:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 09:33:43,640 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-20 09:33:43,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:43,641 INFO L225 Difference]: With dead ends: 128 [2022-11-20 09:33:43,641 INFO L226 Difference]: Without dead ends: 128 [2022-11-20 09:33:43,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=324, Invalid=5683, Unknown=3, NotChecked=152, Total=6162 [2022-11-20 09:33:43,643 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:43,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1597 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1348 Invalid, 0 Unknown, 269 Unchecked, 1.4s Time] [2022-11-20 09:33:43,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-20 09:33:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-11-20 09:33:43,647 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-20 09:33:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2022-11-20 09:33:43,648 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 59 [2022-11-20 09:33:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:43,648 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2022-11-20 09:33:43,649 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-20 09:33:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2022-11-20 09:33:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-20 09:33:43,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:43,650 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-20 09:33:43,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 09:33:43,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:43,859 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-20 09:33:43,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:43,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2022079807, now seen corresponding path program 1 times [2022-11-20 09:33:43,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:43,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818894566] [2022-11-20 09:33:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:43,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:45,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:33:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:45,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:33:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:45,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:33:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:46,208 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-20 09:33:46,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:46,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818894566] [2022-11-20 09:33:46,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818894566] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:46,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938880824] [2022-11-20 09:33:46,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:46,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:46,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:46,210 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:46,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 09:33:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:46,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-20 09:33:46,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:46,615 INFO L350 Elim1Store]: Elim1 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-20 09:33:47,051 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:33:47,051 INFO L350 Elim1Store]: Elim1 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-20 09:33:47,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:33:47,314 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:33:47,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-20 09:33:47,698 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-11-20 09:33:47,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 37 [2022-11-20 09:33:47,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 09:33:47,716 INFO L350 Elim1Store]: Elim1 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-20 09:33:48,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:48,166 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 09:33:48,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 62 [2022-11-20 09:33:48,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:48,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 59 [2022-11-20 09:33:48,207 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-20 09:33:48,208 INFO L350 Elim1Store]: Elim1 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-20 09:33:48,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-11-20 09:33:48,551 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-20 09:33:48,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 26 [2022-11-20 09:33:48,597 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-20 09:33:48,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:48,846 WARN L837 $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-20 09:33:48,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938880824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:48,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:33:48,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 51 [2022-11-20 09:33:48,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783978471] [2022-11-20 09:33:48,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:33:48,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-20 09:33:48,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:48,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-20 09:33:48,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2683, Unknown=1, NotChecked=104, Total=2970 [2022-11-20 09:33:48,850 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-20 09:33:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:52,041 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2022-11-20 09:33:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 09:33:52,042 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-20 09:33:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:52,043 INFO L225 Difference]: With dead ends: 114 [2022-11-20 09:33:52,043 INFO L226 Difference]: Without dead ends: 114 [2022-11-20 09:33:52,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=468, Invalid=4791, Unknown=1, NotChecked=142, Total=5402 [2022-11-20 09:33:52,046 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 129 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:52,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1309 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1246 Invalid, 0 Unknown, 92 Unchecked, 1.1s Time] [2022-11-20 09:33:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-20 09:33:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-20 09:33:52,050 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-20 09:33:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2022-11-20 09:33:52,051 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 61 [2022-11-20 09:33:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:52,051 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2022-11-20 09:33:52,051 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-20 09:33:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2022-11-20 09:33:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-20 09:33:52,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:52,052 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-20 09:33:52,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 09:33:52,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 09:33:52,260 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-20 09:33:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:52,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901353, now seen corresponding path program 1 times [2022-11-20 09:33:52,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:52,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480207800] [2022-11-20 09:33:52,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:52,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:33:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:53,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:33:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:53,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:33:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:53,892 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-20 09:33:53,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:53,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480207800] [2022-11-20 09:33:53,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480207800] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:53,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136792200] [2022-11-20 09:33:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:53,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:53,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:53,894 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:53,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 09:33:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:54,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-20 09:33:54,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:54,400 INFO L350 Elim1Store]: Elim1 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-20 09:33:54,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-20 09:33:55,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:55,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-20 09:33:55,387 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-20 09:33:55,388 INFO L350 Elim1Store]: Elim1 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-20 09:33:56,120 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-20 09:33:56,120 INFO L350 Elim1Store]: Elim1 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-20 09:33:56,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:56,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-20 09:33:56,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 09:33:56,339 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-20 09:33:56,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:56,355 WARN L837 $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-20 09:33:58,373 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4525 Int) (v_ArrVal_4526 (Array Int Int))) (= (select |c_#valid| (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_4525)) |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-20 09:34:01,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136792200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:34:01,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:34:01,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 50 [2022-11-20 09:34:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997786735] [2022-11-20 09:34:01,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:34:01,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-20 09:34:01,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:01,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-20 09:34:01,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=3070, Unknown=3, NotChecked=226, Total=3540 [2022-11-20 09:34:01,431 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-20 09:34:04,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:04,349 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2022-11-20 09:34:04,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 09:34:04,349 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-20 09:34:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:04,350 INFO L225 Difference]: With dead ends: 153 [2022-11-20 09:34:04,351 INFO L226 Difference]: Without dead ends: 153 [2022-11-20 09:34:04,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=572, Invalid=5911, Unknown=5, NotChecked=318, Total=6806 [2022-11-20 09:34:04,353 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 526 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:04,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 923 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1131 Invalid, 0 Unknown, 184 Unchecked, 0.9s Time] [2022-11-20 09:34:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-20 09:34:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2022-11-20 09:34:04,357 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-20 09:34:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2022-11-20 09:34:04,358 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 62 [2022-11-20 09:34:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:04,358 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2022-11-20 09:34:04,359 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-20 09:34:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2022-11-20 09:34:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-20 09:34:04,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:04,361 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-20 09:34:04,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 09:34:04,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 09:34:04,567 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-20 09:34:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:04,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1296901354, now seen corresponding path program 1 times [2022-11-20 09:34:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:04,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574309682] [2022-11-20 09:34:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:04,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:34:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:34:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:06,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:34:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:06,616 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-20 09:34:06,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:06,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574309682] [2022-11-20 09:34:06,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574309682] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:34:06,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838027836] [2022-11-20 09:34:06,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:06,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:34:06,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:34:06,618 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:34:06,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 09:34:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:07,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-20 09:34:07,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:07,140 INFO L350 Elim1Store]: Elim1 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-20 09:34:07,148 INFO L350 Elim1Store]: Elim1 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-20 09:34:07,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-20 09:34:07,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 09:34:08,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:08,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 09:34:08,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:08,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-20 09:34:08,461 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-20 09:34:08,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-20 09:34:08,470 INFO L350 Elim1Store]: Elim1 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-20 09:34:09,060 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-11-20 09:34:09,060 INFO L350 Elim1Store]: Elim1 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-20 09:34:09,101 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 09:34:09,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2022-11-20 09:34:09,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:09,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-20 09:34:09,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:09,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 09:34:09,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 09:34:09,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 09:34:09,387 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-20 09:34:09,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:34:09,593 WARN L837 $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-20 09:34:11,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838027836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:34:11,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:34:11,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 47 [2022-11-20 09:34:11,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696940049] [2022-11-20 09:34:11,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:34:11,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-20 09:34:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-20 09:34:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2874, Unknown=7, NotChecked=108, Total=3192 [2022-11-20 09:34:11,264 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-20 09:34:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:14,157 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2022-11-20 09:34:14,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 09:34:14,158 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-20 09:34:14,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:14,159 INFO L225 Difference]: With dead ends: 138 [2022-11-20 09:34:14,159 INFO L226 Difference]: Without dead ends: 138 [2022-11-20 09:34:14,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=451, Invalid=5094, Unknown=9, NotChecked=146, Total=5700 [2022-11-20 09:34:14,160 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 533 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:14,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 910 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1099 Invalid, 0 Unknown, 96 Unchecked, 1.0s Time] [2022-11-20 09:34:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-20 09:34:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2022-11-20 09:34:14,164 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-20 09:34:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-11-20 09:34:14,174 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 62 [2022-11-20 09:34:14,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:14,174 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-11-20 09:34:14,175 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-20 09:34:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-11-20 09:34:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 09:34:14,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:14,176 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-20 09:34:14,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 09:34:14,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 09:34:14,385 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-20 09:34:14,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1537492107, now seen corresponding path program 1 times [2022-11-20 09:34:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:14,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508996007] [2022-11-20 09:34:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:16,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:34:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:16,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:34:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:16,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:34:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:17,292 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-20 09:34:17,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:17,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508996007] [2022-11-20 09:34:17,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508996007] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:34:17,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644037046] [2022-11-20 09:34:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:17,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:34:17,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:34:17,293 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:34:17,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 09:34:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:17,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 125 conjunts are in the unsatisfiable core [2022-11-20 09:34:17,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:17,798 INFO L350 Elim1Store]: Elim1 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-20 09:34:18,446 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:34:18,446 INFO L350 Elim1Store]: Elim1 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-20 09:34:18,706 INFO L350 Elim1Store]: Elim1 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-20 09:34:18,863 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:34:18,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-20 09:34:19,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:34:19,416 INFO L350 Elim1Store]: Elim1 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-20 09:34:19,422 INFO L350 Elim1Store]: Elim1 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-20 09:34:19,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 09:34:19,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:19,932 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 09:34:19,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 57 [2022-11-20 09:34:19,963 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 09:34:19,963 INFO L350 Elim1Store]: Elim1 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-20 09:34:19,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:19,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-20 09:34:21,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:34:21,654 INFO L321 Elim1Store]: treesize reduction 124, result has 23.9 percent of original size [2022-11-20 09:34:21,654 INFO L350 Elim1Store]: Elim1 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 171 treesize of output 95 [2022-11-20 09:34:21,695 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 09:34:21,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 54 [2022-11-20 09:34:21,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:21,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:34:21,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:21,882 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:34:21,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 60 [2022-11-20 09:34:22,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 09:34:22,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:34:22,286 INFO L350 Elim1Store]: Elim1 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-20 09:34:22,290 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-20 09:34:22,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:34:22,522 WARN L837 $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-20 09:34:24,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644037046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:34:24,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:34:24,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2022-11-20 09:34:24,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451527348] [2022-11-20 09:34:24,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:34:24,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-20 09:34:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:24,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-20 09:34:24,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=5490, Unknown=39, NotChecked=150, Total=6006 [2022-11-20 09:34:24,610 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 states have internal predecessors, (110), 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-20 09:34:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:33,884 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-11-20 09:34:33,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 09:34:33,884 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 states have internal predecessors, (110), 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-20 09:34:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:33,885 INFO L225 Difference]: With dead ends: 124 [2022-11-20 09:34:33,885 INFO L226 Difference]: Without dead ends: 124 [2022-11-20 09:34:33,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=951, Invalid=9520, Unknown=39, NotChecked=202, Total=10712 [2022-11-20 09:34:33,887 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 447 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:33,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1592 Invalid, 2298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2177 Invalid, 0 Unknown, 53 Unchecked, 2.1s Time] [2022-11-20 09:34:33,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-20 09:34:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-11-20 09:34:33,892 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-20 09:34:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2022-11-20 09:34:33,893 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 65 [2022-11-20 09:34:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:33,894 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2022-11-20 09:34:33,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 1.746031746031746) internal successors, (110), 56 states have internal predecessors, (110), 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-20 09:34:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2022-11-20 09:34:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 09:34:33,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:33,895 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-20 09:34:33,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 09:34:34,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 09:34:34,103 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-20 09:34:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:34,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1304596198, now seen corresponding path program 1 times [2022-11-20 09:34:34,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:34,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899663981] [2022-11-20 09:34:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:34,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:34,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:34:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:34,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:34:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:34,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:34:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:34,286 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-20 09:34:34,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:34,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899663981] [2022-11-20 09:34:34,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899663981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:34,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:34,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:34:34,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987401475] [2022-11-20 09:34:34,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:34,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:34:34,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:34,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:34:34,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:34:34,289 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-20 09:34:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:34,426 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2022-11-20 09:34:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:34:34,427 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-20 09:34:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:34,427 INFO L225 Difference]: With dead ends: 125 [2022-11-20 09:34:34,427 INFO L226 Difference]: Without dead ends: 125 [2022-11-20 09:34:34,428 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-20 09:34:34,428 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:34,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 280 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:34:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-20 09:34:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2022-11-20 09:34:34,433 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-20 09:34:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2022-11-20 09:34:34,433 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 68 [2022-11-20 09:34:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:34,434 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2022-11-20 09:34:34,434 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-20 09:34:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2022-11-20 09:34:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 09:34:34,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:34,435 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-20 09:34:34,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 09:34:34,436 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-20 09:34:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1304640900, now seen corresponding path program 1 times [2022-11-20 09:34:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:34,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998392270] [2022-11-20 09:34:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:34,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:36,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:34:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:37,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:34:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:37,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:34:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:38,226 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-20 09:34:38,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:38,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998392270] [2022-11-20 09:34:38,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998392270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:34:38,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732309233] [2022-11-20 09:34:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:38,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:34:38,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:34:38,229 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:34:38,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 09:34:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:38,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-20 09:34:38,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:38,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:34:39,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:34:39,532 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:34:39,532 INFO L350 Elim1Store]: Elim1 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-20 09:34:39,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:34:39,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:34:39,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:39,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 09:34:40,156 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:34:40,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-20 09:34:40,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 09:34:40,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:34:40,809 INFO L350 Elim1Store]: Elim1 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-20 09:34:40,816 INFO L350 Elim1Store]: Elim1 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-20 09:34:40,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 09:34:41,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:41,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-20 09:34:41,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:41,488 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 09:34:41,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 60 [2022-11-20 09:34:41,512 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-20 09:34:41,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2022-11-20 09:34:41,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:34:41,560 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 09:34:41,560 INFO L350 Elim1Store]: Elim1 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-20 09:34:43,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:43,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:34:43,307 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-11-20 09:34:43,307 INFO L350 Elim1Store]: Elim1 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 76 [2022-11-20 09:34:43,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:43,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 09:34:43,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-20 09:34:43,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:43,536 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:34:43,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 63 [2022-11-20 09:34:43,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 09:34:43,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:43,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:34:43,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:34:43,785 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 27 [2022-11-20 09:34:43,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 09:34:44,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 09:34:44,154 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-20 09:34:44,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:34:44,187 WARN L837 $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-20 09:34:44,201 WARN L837 $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-20 09:34:45,976 WARN L837 $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-20 09:34:45,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732309233] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:34:45,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:34:45,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 65 [2022-11-20 09:34:45,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129795494] [2022-11-20 09:34:45,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:34:45,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-20 09:34:45,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:45,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-20 09:34:45,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=4855, Unknown=4, NotChecked=426, Total=5550 [2022-11-20 09:34:45,983 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-20 09:34:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:55,808 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2022-11-20 09:34:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-20 09:34:55,809 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-20 09:34:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:55,810 INFO L225 Difference]: With dead ends: 183 [2022-11-20 09:34:55,810 INFO L226 Difference]: Without dead ends: 183 [2022-11-20 09:34:55,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2429 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=965, Invalid=9755, Unknown=4, NotChecked=618, Total=11342 [2022-11-20 09:34:55,813 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1222 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:55,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 1197 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-20 09:34:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-20 09:34:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 126. [2022-11-20 09:34:55,818 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-20 09:34:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2022-11-20 09:34:55,819 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 68 [2022-11-20 09:34:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:55,819 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2022-11-20 09:34:55,820 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-20 09:34:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2022-11-20 09:34:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 09:34:55,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:55,821 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-20 09:34:55,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 09:34:56,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 09:34:56,030 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-20 09:34:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:56,031 INFO L85 PathProgramCache]: Analyzing trace with hash -370531362, now seen corresponding path program 1 times [2022-11-20 09:34:56,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:56,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800665321] [2022-11-20 09:34:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:58,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:34:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:34:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:34:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:59,981 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-20 09:34:59,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800665321] [2022-11-20 09:34:59,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800665321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:34:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715605209] [2022-11-20 09:34:59,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:59,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:34:59,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:34:59,983 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:34:59,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 09:35:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:00,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-20 09:35:00,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:00,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:35:01,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:35:01,320 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:35:01,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:35:01,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:35:01,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:35:01,766 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:35:01,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-11-20 09:35:01,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 09:35:02,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:35:02,343 INFO L350 Elim1Store]: Elim1 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 61 treesize of output 28 [2022-11-20 09:35:02,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:35:02,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 09:35:02,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:35:03,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:03,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:03,021 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 09:35:03,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-20 09:35:03,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:03,042 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:35:03,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-11-20 09:35:03,062 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 09:35:03,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 09:35:04,431 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 09:35:04,432 INFO L350 Elim1Store]: Elim1 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 136 treesize of output 109 [2022-11-20 09:35:04,469 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-20 09:35:04,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 70 [2022-11-20 09:35:04,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:04,670 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:35:04,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 84 [2022-11-20 09:35:04,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:04,686 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 09:35:04,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2022-11-20 09:35:05,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:35:05,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:35:05,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:05,597 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2022-11-20 09:35:05,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 55 [2022-11-20 09:35:05,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:05,621 INFO L321 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2022-11-20 09:35:05,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 31 [2022-11-20 09:35:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:35:05,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:35:06,963 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883) |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 .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_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883))) (let ((.cse2 (select (select .cse4 |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_23| 4))) (<= (+ (select (select .cse1 .cse2) .cse3) 8) (select |c_#length| (select (select .cse4 .cse2) .cse3))))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (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_23|))))) is different from false [2022-11-20 09:35:07,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:35:07,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 128 [2022-11-20 09:35:08,325 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (< (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883) |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)) (+ |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 1)) (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_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883))) (select .cse1 (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_23| 4)) |c_ULTIMATE.start_dll_append_#t~mem10#1.base|) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884) |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_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_32 Int) (v_prenex_34 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_prenex_34) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_35))) (or (< (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_32) (not (<= 0 v_prenex_32)) (<= 0 (+ (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_prenex_33) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ v_prenex_32 4)) 4)))))) is different from false [2022-11-20 09:35:08,377 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4))) (and (forall ((v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_34) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_35))) (or (not (<= 0 v_prenex_32)) (<= 0 (+ (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_prenex_33) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ v_prenex_32 4)) 4)) (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_32)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884) |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|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (= .cse1 (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883))) (select .cse2 (select (select .cse2 |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))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (< (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883) |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)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse4) 1)) (< (select (select .cse3 |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|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)))))))) is different from false [2022-11-20 09:35:08,531 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse2))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (< (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883) |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)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse2) 1)) (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_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (or (= .cse1 (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883))) (select .cse3 (select (select .cse3 |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))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884) |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_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_34) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_35))) (or (<= 0 (+ 4 (select (select .cse4 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_prenex_33) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ v_prenex_32 4)))) (< (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_32) (not (<= 0 v_prenex_32)))))))) is different from false [2022-11-20 09:35:08,584 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (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 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884) |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|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883))) (select .cse1 (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_23| 4)) .cse0))) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_34) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_35))) (or (<= 0 (+ 4 (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_prenex_33) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ v_prenex_32 4)))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_32) (not (<= 0 v_prenex_32))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5884))) (or (< (select (select .cse3 |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|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_5883) |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)) (+ (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5) 1)))))))) is different from false [2022-11-20 09:35:08,737 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (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 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5884) |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|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5883))) (select .cse1 (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_23| 4)) .cse0))) (forall ((v_prenex_36 (Array Int Int)) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int)) (v_prenex_32 Int) (v_prenex_33 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_34) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_prenex_35))) (or (< (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) v_prenex_32) (<= 0 (+ (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_prenex_33) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_prenex_36) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ v_prenex_32 4)) 4)) (not (<= 0 v_prenex_32))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_23| Int) (v_ArrVal_5882 (Array Int Int)) (v_ArrVal_5881 (Array Int Int)) (v_ArrVal_5884 (Array Int Int)) (v_ArrVal_5883 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5881) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5884))) (or (< (select (select .cse3 |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|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_23|)) (< (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5882) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_5883) |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)) (+ (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5) 1)))))))) is different from false [2022-11-20 09:35:09,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715605209] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:35:09,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:35:09,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2022-11-20 09:35:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775915220] [2022-11-20 09:35:09,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:35:09,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-20 09:35:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-20 09:35:09,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=5883, Unknown=65, NotChecked=954, Total=7140 [2022-11-20 09:35:09,623 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 70 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 61 states have internal predecessors, (127), 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-20 09:35:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:35:16,436 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2022-11-20 09:35:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 09:35:16,436 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 61 states have internal predecessors, (127), 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-20 09:35:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:35:16,437 INFO L225 Difference]: With dead ends: 157 [2022-11-20 09:35:16,437 INFO L226 Difference]: Without dead ends: 157 [2022-11-20 09:35:16,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1583 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=499, Invalid=10172, Unknown=65, NotChecked=1254, Total=11990 [2022-11-20 09:35:16,440 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 276 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:35:16,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1692 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2267 Invalid, 0 Unknown, 249 Unchecked, 2.0s Time] [2022-11-20 09:35:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-20 09:35:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2022-11-20 09:35:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.2477064220183487) internal successors, (136), 124 states have internal predecessors, (136), 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-20 09:35:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2022-11-20 09:35:16,445 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 70 [2022-11-20 09:35:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:35:16,445 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2022-11-20 09:35:16,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 61 states have internal predecessors, (127), 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-20 09:35:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2022-11-20 09:35:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 09:35:16,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:35:16,447 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-20 09:35:16,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:16,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:16,654 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-20 09:35:16,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash -370531363, now seen corresponding path program 1 times [2022-11-20 09:35:16,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:16,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459965394] [2022-11-20 09:35:16,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:16,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:35:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:35:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:18,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:35:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:35:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:19,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459965394] [2022-11-20 09:35:19,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459965394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:35:19,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334841188] [2022-11-20 09:35:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:19,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:19,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:19,943 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:19,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 09:35:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:20,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-20 09:35:20,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:20,527 INFO L350 Elim1Store]: Elim1 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-20 09:35:21,299 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:35:21,300 INFO L350 Elim1Store]: Elim1 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-20 09:35:21,551 INFO L350 Elim1Store]: Elim1 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-20 09:35:21,723 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:35:21,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-20 09:35:22,300 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 09:35:22,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 29 [2022-11-20 09:35:22,307 INFO L350 Elim1Store]: Elim1 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-20 09:35:23,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:23,164 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:35:23,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 80 [2022-11-20 09:35:23,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:23,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2022-11-20 09:35:23,227 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2022-11-20 09:35:23,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 09:35:24,254 INFO L321 Elim1Store]: treesize reduction 90, result has 33.3 percent of original size [2022-11-20 09:35:24,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 95 [2022-11-20 09:35:24,285 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-20 09:35:24,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 91 [2022-11-20 09:35:24,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:24,343 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:35:24,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 98 [2022-11-20 09:35:24,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:24,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2022-11-20 09:35:24,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2022-11-20 09:35:24,993 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-20 09:35:24,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 34 [2022-11-20 09:35:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:35:25,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:35:25,414 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6179 (Array Int Int)) (v_ArrVal_6180 (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_6179))) (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_6180) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2022-11-20 09:35:27,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334841188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:35:27,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:35:27,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30] total 65 [2022-11-20 09:35:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059508383] [2022-11-20 09:35:27,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:35:27,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-20 09:35:27,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-20 09:35:27,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=4983, Unknown=35, NotChecked=142, Total=5402 [2022-11-20 09:35:27,010 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 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-20 09:35:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:35:36,269 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2022-11-20 09:35:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 09:35:36,269 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 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-20 09:35:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:35:36,271 INFO L225 Difference]: With dead ends: 156 [2022-11-20 09:35:36,271 INFO L226 Difference]: Without dead ends: 156 [2022-11-20 09:35:36,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=546, Invalid=8923, Unknown=41, NotChecked=192, Total=9702 [2022-11-20 09:35:36,272 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 169 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:35:36,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1834 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1938 Invalid, 0 Unknown, 267 Unchecked, 2.0s Time] [2022-11-20 09:35:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-20 09:35:36,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 136. [2022-11-20 09:35:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 129 states have internal predecessors, (142), 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-20 09:35:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2022-11-20 09:35:36,278 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 70 [2022-11-20 09:35:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:35:36,279 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2022-11-20 09:35:36,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 63 states have (on average 2.015873015873016) internal successors, (127), 57 states have internal predecessors, (127), 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-20 09:35:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2022-11-20 09:35:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 09:35:36,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:35:36,280 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-20 09:35:36,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:36,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:36,489 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 09:35:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:36,489 INFO L85 PathProgramCache]: Analyzing trace with hash -563372747, now seen corresponding path program 1 times [2022-11-20 09:35:36,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:36,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47222591] [2022-11-20 09:35:36,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:36,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:39,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:35:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:35:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:35:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:40,986 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-20 09:35:40,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:40,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47222591] [2022-11-20 09:35:40,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47222591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:35:40,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676397670] [2022-11-20 09:35:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:40,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:40,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:40,988 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:40,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 09:35:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:41,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 153 conjunts are in the unsatisfiable core [2022-11-20 09:35:41,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:41,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:35:42,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:35:42,430 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:35:42,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:35:42,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:35:42,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:35:43,009 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:35:43,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-20 09:35:43,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 09:35:43,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:35:43,701 INFO L350 Elim1Store]: Elim1 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-20 09:35:43,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:35:43,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:35:43,717 INFO L350 Elim1Store]: Elim1 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-20 09:35:44,551 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 09:35:44,552 INFO L350 Elim1Store]: Elim1 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-20 09:35:46,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:35:46,325 INFO L321 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2022-11-20 09:35:46,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 82 [2022-11-20 09:35:46,361 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-20 09:35:46,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 125 [2022-11-20 09:35:46,616 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 09:35:46,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 191 [2022-11-20 09:35:46,648 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-20 09:35:46,648 INFO L350 Elim1Store]: Elim1 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 249 treesize of output 203 [2022-11-20 09:35:47,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:47,905 INFO L321 Elim1Store]: treesize reduction 36, result has 16.3 percent of original size [2022-11-20 09:35:47,905 INFO L350 Elim1Store]: Elim1 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 229 treesize of output 134 [2022-11-20 09:35:48,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:35:48,438 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-20 09:35:48,438 INFO L350 Elim1Store]: Elim1 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 108 treesize of output 45 [2022-11-20 09:35:48,562 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-20 09:35:48,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:35:49,631 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6480))) (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_28|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)) (not (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6479))) (let ((.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_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0))))) is different from false [2022-11-20 09:35:49,917 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6476 (Array Int Int)) (v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6476) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6480))) (or (not (= (let ((.cse0 (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_6479))) (let ((.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_28| 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)) (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))) is different from false [2022-11-20 09:35:50,243 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6476 (Array Int Int)) (v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6476) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6480))) (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_28|) (not (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6479))) (let ((.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_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) is different from false [2022-11-20 09:35:50,265 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6476 (Array Int Int)) (v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6476) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6480))) (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_28|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)) (not (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6479))) (let ((.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_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0))))))) is different from false [2022-11-20 09:35:50,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6476 (Array Int Int)) (v_ArrVal_6479 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_6476) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6480))) (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_28|) (not (= (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_6479))) (let ((.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_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse0 .cse2) .cse3) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|))))))) is different from false [2022-11-20 09:35:50,471 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6476 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| Int) (v_ArrVal_6489 (Array Int Int)) (v_ArrVal_6479 (Array Int Int)) (v_ArrVal_6490 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_28| Int) (v_ArrVal_6480 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6489)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6490))) (let ((.cse7 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select .cse6 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select .cse4 .cse7) .cse8))) (let ((.cse0 (store (store .cse6 .cse5 v_ArrVal_6476) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6480))) (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_28|) (= |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55|) 0)) (not (= (let ((.cse1 (store (store .cse4 .cse5 (store (select .cse4 .cse5) (+ 4 (select (select .cse6 .cse7) .cse8)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| v_ArrVal_6479))) (let ((.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_28| 4))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (+ 4 (select (select .cse0 .cse2) .cse3))))) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_55| |c_#StackHeapBarrier|)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_28|)))))))) is different from false [2022-11-20 09:35:50,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676397670] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:35:50,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:35:50,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 66 [2022-11-20 09:35:50,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744044928] [2022-11-20 09:35:50,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:35:50,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-20 09:35:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-20 09:35:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=5186, Unknown=11, NotChecked=894, Total=6320 [2022-11-20 09:35:50,477 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 66 states, 64 states have (on average 1.90625) internal successors, (122), 57 states have internal predecessors, (122), 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) [2022-11-20 09:36:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:00,089 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-11-20 09:36:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 09:36:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 64 states have (on average 1.90625) internal successors, (122), 57 states have internal predecessors, (122), 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) Word has length 74 [2022-11-20 09:36:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:36:00,092 INFO L225 Difference]: With dead ends: 136 [2022-11-20 09:36:00,092 INFO L226 Difference]: Without dead ends: 136 [2022-11-20 09:36:00,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 103 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=694, Invalid=9021, Unknown=11, NotChecked=1194, Total=10920 [2022-11-20 09:36:00,094 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 385 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:36:00,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1935 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1984 Invalid, 0 Unknown, 210 Unchecked, 2.8s Time] [2022-11-20 09:36:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-20 09:36:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2022-11-20 09:36:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.238938053097345) internal successors, (140), 128 states have internal predecessors, (140), 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-20 09:36:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-11-20 09:36:00,099 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 74 [2022-11-20 09:36:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:36:00,100 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-11-20 09:36:00,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 64 states have (on average 1.90625) internal successors, (122), 57 states have internal predecessors, (122), 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) [2022-11-20 09:36:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-11-20 09:36:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 09:36:00,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:36:00,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:00,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:00,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:00,315 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-20 09:36:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash -563328045, now seen corresponding path program 1 times [2022-11-20 09:36:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:00,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929282563] [2022-11-20 09:36:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:36:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:03,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:36:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:04,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:36:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:36:05,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:05,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929282563] [2022-11-20 09:36:05,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929282563] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:05,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437345591] [2022-11-20 09:36:05,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:05,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:05,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:05,049 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:05,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 09:36:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:05,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 176 conjunts are in the unsatisfiable core [2022-11-20 09:36:05,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:05,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:36:06,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:36:06,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:06,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 09:36:06,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 09:36:06,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:36:07,234 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:36:07,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:36:07,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:36:07,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:36:07,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:36:07,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:36:07,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:36:07,905 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:36:07,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2022-11-20 09:36:07,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:07,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-11-20 09:36:07,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 09:36:08,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:36:08,703 INFO L350 Elim1Store]: Elim1 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 78 treesize of output 37 [2022-11-20 09:36:08,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 09:36:08,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:36:08,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 09:36:08,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:36:09,559 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 09:36:09,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 09:36:11,352 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 09:36:11,352 INFO L350 Elim1Store]: Elim1 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 174 treesize of output 135 [2022-11-20 09:36:11,389 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-20 09:36:11,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 91 [2022-11-20 09:36:11,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:36:11,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:11,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2022-11-20 09:36:11,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:11,632 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:36:11,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 66 [2022-11-20 09:36:11,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 09:36:11,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:11,659 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 09:36:11,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-20 09:36:12,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:36:12,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:12,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:36:12,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 42 [2022-11-20 09:36:12,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:12,588 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 09:36:12,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 31 treesize of output 16 [2022-11-20 09:36:12,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 09:36:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:36:12,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:13,754 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6793 (Array Int Int)) (v_ArrVal_6792 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6791 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6793))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6791))) (let ((.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))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6792) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (< (select (select .cse3 |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-20 09:36:13,778 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6793 (Array Int Int)) (v_ArrVal_6790 Int) (v_ArrVal_6792 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6787 (Array Int Int)) (v_ArrVal_6789 (Array Int Int)) (v_ArrVal_6791 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6789) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6793))) (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 (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_6787) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6791))) (let ((.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))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) v_ArrVal_6790)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6792) (select (select .cse1 .cse2) .cse3)) (select (select .cse0 .cse2) .cse3)))))))) is different from false [2022-11-20 09:36:13,842 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6793 (Array Int Int)) (v_ArrVal_6790 Int) (v_ArrVal_6792 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6787 (Array Int Int)) (v_ArrVal_6789 (Array Int Int)) (v_ArrVal_6791 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6789) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6793))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_6787) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6791))) (let ((.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))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_#t~mem10#1.base|) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4) v_ArrVal_6790)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6792) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (< (select (select .cse3 |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 (<= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| |v_ULTIMATE.start_dll_append_~last~0#1.offset_41|)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))) is different from false [2022-11-20 09:36:13,907 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6793 (Array Int Int)) (v_ArrVal_6790 Int) (v_ArrVal_6792 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6787 (Array Int Int)) (v_ArrVal_6789 (Array Int Int)) (v_ArrVal_6791 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6789) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6793))) (or (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0)) (< (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|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6787) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6791))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (select (select (store (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4) v_ArrVal_6790)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_6792) (select (select .cse3 .cse4) .cse5)) (select (select .cse1 .cse4) .cse5))))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))))) is different from false [2022-11-20 09:36:16,343 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6808 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_6791 (Array Int Int)) (v_ArrVal_6793 (Array Int Int)) (v_ArrVal_6790 Int) (v_ArrVal_6792 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_41| Int) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| Int) (v_ArrVal_6787 (Array Int Int)) (v_ArrVal_6789 (Array Int Int)) (v_ArrVal_6807 (Array Int Int)) (v_ArrVal_6806 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6808)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6807))) (let ((.cse8 (select (select .cse6 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse9 (+ (select (select .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse1 (select (select .cse6 .cse8) .cse9))) (let ((.cse5 (store (store .cse7 .cse1 v_ArrVal_6789) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6793))) (or (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store .cse6 .cse1 v_ArrVal_6787) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6791))) (let ((.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))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6806))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| 4) v_ArrVal_6790))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58| v_ArrVal_6792) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_58|) 0)) (< |v_ULTIMATE.start_dll_append_~last~0#1.offset_41| (select (select .cse7 .cse8) .cse9)) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (< (select (select .cse5 |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|))))))) is different from false [2022-11-20 09:36:16,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437345591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:16,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:16,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 69 [2022-11-20 09:36:16,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271073846] [2022-11-20 09:36:16,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:16,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-11-20 09:36:16,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:16,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-11-20 09:36:16,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=5422, Unknown=30, NotChecked=760, Total=6480 [2022-11-20 09:36:16,349 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 69 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 60 states have internal predecessors, (124), 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) [2022-11-20 09:36:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:21,806 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-11-20 09:36:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-20 09:36:21,807 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 60 states have internal predecessors, (124), 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) Word has length 74 [2022-11-20 09:36:21,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:36:21,808 INFO L225 Difference]: With dead ends: 137 [2022-11-20 09:36:21,808 INFO L226 Difference]: Without dead ends: 137 [2022-11-20 09:36:21,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 99 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=503, Invalid=8605, Unknown=32, NotChecked=960, Total=10100 [2022-11-20 09:36:21,809 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 151 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:36:21,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1901 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1877 Invalid, 0 Unknown, 229 Unchecked, 2.3s Time] [2022-11-20 09:36:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-20 09:36:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-11-20 09:36:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 128 states have internal predecessors, (139), 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-20 09:36:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2022-11-20 09:36:21,814 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 74 [2022-11-20 09:36:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:36:21,815 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2022-11-20 09:36:21,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 60 states have internal predecessors, (124), 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) [2022-11-20 09:36:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2022-11-20 09:36:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-20 09:36:21,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:36:21,816 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:21,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:22,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:22,024 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 09:36:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:22,024 INFO L85 PathProgramCache]: Analyzing trace with hash 364845693, now seen corresponding path program 3 times [2022-11-20 09:36:22,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:22,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621081955] [2022-11-20 09:36:22,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:22,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:36:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:22,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:36:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:22,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 09:36:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:22,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 09:36:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-20 09:36:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:22,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621081955] [2022-11-20 09:36:22,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621081955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:22,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422756885] [2022-11-20 09:36:22,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:36:22,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:22,203 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:22,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 09:36:23,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 09:36:23,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:23,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-20 09:36:23,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:23,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:36:23,448 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 09:36:23,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2022-11-20 09:36:23,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:23,869 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:36:23,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-11-20 09:36:23,914 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-20 09:36:23,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-11-20 09:36:24,121 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:36:24,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 41 [2022-11-20 09:36:24,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:36:24,258 INFO L321 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-11-20 09:36:24,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-11-20 09:36:24,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:24,477 INFO L321 Elim1Store]: treesize reduction 106, result has 23.7 percent of original size [2022-11-20 09:36:24,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 88 [2022-11-20 09:36:24,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 77 [2022-11-20 09:36:25,168 INFO L321 Elim1Store]: treesize reduction 70, result has 13.6 percent of original size [2022-11-20 09:36:25,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 60 [2022-11-20 09:36:25,184 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 09:36:25,184 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 09:36:25,207 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 09:36:25,207 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 18 [2022-11-20 09:36:25,573 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_7171 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_7171) |c_#memory_$Pointer$.offset|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_7172 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_7172))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-20 09:36:25,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:25,691 INFO L321 Elim1Store]: treesize reduction 90, result has 15.1 percent of original size [2022-11-20 09:36:25,691 INFO L350 Elim1Store]: Elim1 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 164 treesize of output 126 [2022-11-20 09:36:25,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:25,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:25,709 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 09:36:25,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 148 [2022-11-20 09:36:25,802 INFO L321 Elim1Store]: treesize reduction 202, result has 33.1 percent of original size [2022-11-20 09:36:25,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 117 [2022-11-20 09:36:26,691 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 09:36:26,691 INFO L350 Elim1Store]: Elim1 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 223 treesize of output 164 [2022-11-20 09:36:27,287 INFO L321 Elim1Store]: treesize reduction 46, result has 31.3 percent of original size [2022-11-20 09:36:27,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 71 [2022-11-20 09:36:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-20 09:36:27,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:28,442 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_100| Int) (v_ArrVal_7183 (Array Int Int)) (v_ArrVal_7182 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_100| v_ArrVal_7183)) (.cse3 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_100| v_ArrVal_7182))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse5 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse0 (store |c_#valid| |v_node_create_~temp~0#1.base_100| 1)) (.cse1 (select (select .cse3 .cse2) .cse5))) (or (not (< |v_node_create_~temp~0#1.base_100| |c_#StackHeapBarrier|)) (not (= (select .cse0 .cse1) 1)) (not (= (select .cse0 .cse2) 1)) (= (select .cse0 (select (select .cse3 .cse1) (+ (select (select .cse4 .cse2) .cse5) 4))) 1) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_100|) 0))))))) is different from false [2022-11-20 09:36:28,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422756885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:28,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:36:28,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 33] total 38 [2022-11-20 09:36:28,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244941980] [2022-11-20 09:36:28,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:28,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 09:36:28,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:28,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 09:36:28,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1843, Unknown=5, NotChecked=174, Total=2162 [2022-11-20 09:36:28,448 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-20 09:36:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:29,775 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-11-20 09:36:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 09:36:29,776 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2022-11-20 09:36:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:36:29,777 INFO L225 Difference]: With dead ends: 90 [2022-11-20 09:36:29,777 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 09:36:29,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=231, Invalid=3191, Unknown=8, NotChecked=230, Total=3660 [2022-11-20 09:36:29,778 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 13 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 539 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:36:29,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 987 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 276 Invalid, 0 Unknown, 539 Unchecked, 0.3s Time] [2022-11-20 09:36:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 09:36:29,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-20 09:36:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 85 states have internal predecessors, (89), 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-20 09:36:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-11-20 09:36:29,782 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 75 [2022-11-20 09:36:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:36:29,782 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-11-20 09:36:29,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.72972972972973) internal successors, (101), 33 states have internal predecessors, (101), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-20 09:36:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-11-20 09:36:29,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 09:36:29,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:36:29,784 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:29,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 09:36:29,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:29,991 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 09:36:29,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:29,991 INFO L85 PathProgramCache]: Analyzing trace with hash -192357779, now seen corresponding path program 2 times [2022-11-20 09:36:29,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:29,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387894207] [2022-11-20 09:36:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:29,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:34,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:36:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:34,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:36:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:34,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:36:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:36:35,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:35,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387894207] [2022-11-20 09:36:35,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387894207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:35,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147525465] [2022-11-20 09:36:35,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:36:35,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:35,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:35,258 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:35,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 09:36:35,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:36:35,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:36:35,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 190 conjunts are in the unsatisfiable core [2022-11-20 09:36:35,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:35,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:36:35,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:36:36,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:36,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:36:36,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:36:36,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:36:37,276 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:36:37,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 09:36:37,298 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:36:37,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:36:37,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:36:37,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:36:38,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:36:38,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-11-20 09:36:38,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 09:36:38,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:36:38,943 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 41 [2022-11-20 09:36:38,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 09:36:38,961 INFO L350 Elim1Store]: Elim1 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-20 09:36:38,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:36:38,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 09:36:40,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:40,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-20 09:36:40,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:40,177 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:36:40,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 76 [2022-11-20 09:36:40,218 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-20 09:36:40,218 INFO L350 Elim1Store]: Elim1 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-20 09:36:40,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:40,236 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 09:36:40,236 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 30 [2022-11-20 09:36:42,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:36:42,608 INFO L321 Elim1Store]: treesize reduction 135, result has 17.2 percent of original size [2022-11-20 09:36:42,608 INFO L350 Elim1Store]: Elim1 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 7 new quantified variables, introduced 9 case distinctions, treesize of input 248 treesize of output 132 [2022-11-20 09:36:42,657 INFO L321 Elim1Store]: treesize reduction 128, result has 14.7 percent of original size [2022-11-20 09:36:42,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 94 [2022-11-20 09:36:42,982 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 09:36:42,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 292 treesize of output 203 [2022-11-20 09:36:42,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:43,032 INFO L321 Elim1Store]: treesize reduction 110, result has 20.3 percent of original size [2022-11-20 09:36:43,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 237 treesize of output 190 [2022-11-20 09:36:47,934 INFO L321 Elim1Store]: treesize reduction 170, result has 62.8 percent of original size [2022-11-20 09:36:47,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 36 case distinctions, treesize of input 521 treesize of output 513 [2022-11-20 09:36:48,790 INFO L321 Elim1Store]: treesize reduction 128, result has 66.4 percent of original size [2022-11-20 09:36:48,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 511 treesize of output 609 [2022-11-20 09:37:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:37:31,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:37:43,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147525465] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:37:43,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:37:43,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40] total 77 [2022-11-20 09:37:43,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210651500] [2022-11-20 09:37:43,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:37:43,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-20 09:37:43,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:43,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-20 09:37:43,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=9012, Unknown=12, NotChecked=0, Total=9312 [2022-11-20 09:37:43,591 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 78 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 68 states have internal predecessors, (139), 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-20 09:37:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:37:56,013 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2022-11-20 09:37:56,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 09:37:56,014 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 68 states have internal predecessors, (139), 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 76 [2022-11-20 09:37:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:37:56,014 INFO L225 Difference]: With dead ends: 92 [2022-11-20 09:37:56,014 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 09:37:56,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2888 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=604, Invalid=15383, Unknown=15, NotChecked=0, Total=16002 [2022-11-20 09:37:56,020 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 80 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:37:56,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1825 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1872 Invalid, 0 Unknown, 336 Unchecked, 2.4s Time] [2022-11-20 09:37:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 09:37:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-20 09:37:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 87 states have internal predecessors, (92), 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-20 09:37:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-11-20 09:37:56,024 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 76 [2022-11-20 09:37:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:37:56,025 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-11-20 09:37:56,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 68 states have internal predecessors, (139), 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-20 09:37:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-11-20 09:37:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 09:37:56,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:37:56,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:56,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-20 09:37:56,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-20 09:37:56,231 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 09:37:56,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash -192357780, now seen corresponding path program 2 times [2022-11-20 09:37:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:56,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660186443] [2022-11-20 09:37:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:03,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:38:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:03,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:38:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:04,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:38:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:38:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:38:06,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660186443] [2022-11-20 09:38:06,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660186443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:38:06,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583327103] [2022-11-20 09:38:06,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:38:06,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:38:06,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:38:06,480 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:38:06,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 09:38:07,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:38:07,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:38:07,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 149 conjunts are in the unsatisfiable core [2022-11-20 09:38:07,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:38:08,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:38:08,553 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:38:08,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:38:09,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:38:09,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:38:09,247 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:38:09,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-20 09:38:09,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 09:38:10,070 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 09:38:10,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 36 [2022-11-20 09:38:10,101 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 09:38:10,102 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 18 [2022-11-20 09:38:10,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:38:11,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:38:11,315 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:38:11,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 83 [2022-11-20 09:38:11,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:38:11,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:38:11,331 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 09:38:11,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 83 [2022-11-20 09:38:11,403 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2022-11-20 09:38:11,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 09:38:13,579 INFO L321 Elim1Store]: treesize reduction 84, result has 20.0 percent of original size [2022-11-20 09:38:13,580 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 95 [2022-11-20 09:38:13,614 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-20 09:38:13,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 141 [2022-11-20 09:38:13,937 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 09:38:13,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 339 treesize of output 232 [2022-11-20 09:38:13,973 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-20 09:38:13,973 INFO L350 Elim1Store]: Elim1 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 290 treesize of output 240 [2022-11-20 09:38:15,260 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 09:38:15,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 169 [2022-11-20 09:38:15,973 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:38:15,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 56 [2022-11-20 09:38:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:38:16,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:38:17,760 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_7768) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7772)) (.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|) (+ |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_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))) 1)) is different from false [2022-11-20 09:38:17,786 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_7768) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7772)) (.cse0 (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_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))) 1)) is different from false [2022-11-20 09:38:17,804 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_7768) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7772)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ 4 (select (select .cse3 .cse1) .cse2)))))))) 1)) is different from false [2022-11-20 09:38:17,831 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_7768) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7772)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse5) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))))) 1)) is different from false [2022-11-20 09:38:17,848 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_7768) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7772)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))))) 1)) is different from false [2022-11-20 09:38:17,882 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7768 (Array Int Int))) (= (select |c_#valid| (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_7768) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_7772)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))))) 1)) is different from false [2022-11-20 09:38:18,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583327103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:38:18,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:38:18,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 37] total 82 [2022-11-20 09:38:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087673996] [2022-11-20 09:38:18,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:38:18,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-20 09:38:18,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:38:18,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-20 09:38:18,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=7528, Unknown=65, NotChecked=1074, Total=8930 [2022-11-20 09:38:18,588 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 83 states, 80 states have (on average 1.7375) internal successors, (139), 74 states have internal predecessors, (139), 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-20 09:38:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:38:30,344 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-11-20 09:38:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 09:38:30,345 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 80 states have (on average 1.7375) internal successors, (139), 74 states have internal predecessors, (139), 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 76 [2022-11-20 09:38:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:38:30,346 INFO L225 Difference]: With dead ends: 106 [2022-11-20 09:38:30,346 INFO L226 Difference]: Without dead ends: 106 [2022-11-20 09:38:30,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3041 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=599, Invalid=14107, Unknown=80, NotChecked=1470, Total=16256 [2022-11-20 09:38:30,348 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 145 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:38:30,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1586 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2329 Invalid, 0 Unknown, 203 Unchecked, 3.3s Time] [2022-11-20 09:38:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-20 09:38:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2022-11-20 09:38:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 87 states have internal predecessors, (91), 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-20 09:38:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-11-20 09:38:30,352 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 76 [2022-11-20 09:38:30,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:38:30,352 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-11-20 09:38:30,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 80 states have (on average 1.7375) internal successors, (139), 74 states have internal predecessors, (139), 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-20 09:38:30,353 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-11-20 09:38:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-20 09:38:30,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:38:30,354 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:38:30,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-20 09:38:30,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-20 09:38:30,565 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 09:38:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:38:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash -172230625, now seen corresponding path program 1 times [2022-11-20 09:38:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:38:30,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646719308] [2022-11-20 09:38:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:38:30,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:38:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:38:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:33,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:38:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:33,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:38:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:38:34,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:38:34,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646719308] [2022-11-20 09:38:34,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646719308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:38:34,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519358631] [2022-11-20 09:38:34,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:38:34,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:38:34,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:38:34,603 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:38:34,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 09:38:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:35,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 160 conjunts are in the unsatisfiable core [2022-11-20 09:38:35,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:38:35,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:38:35,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:38:36,072 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:38:36,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:38:36,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:38:36,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:38:36,544 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:38:36,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-20 09:38:36,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 09:38:37,177 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 09:38:37,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 36 [2022-11-20 09:38:37,197 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 09:38:37,198 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 18 [2022-11-20 09:38:37,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:38:37,965 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-20 09:38:37,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 09:38:38,075 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse1))) (or (let ((.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 .cse1)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (not (= .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| (Array Int (Array Int Int)))) (let ((.cse5 (+ (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select .cse3 .cse5)) (.cse6 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_#memory_$Pointer$.offset|))) (and (<= (+ 2 .cse4) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 .cse1)) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse1) .cse5)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)) |c_#memory_$Pointer$.offset|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (= .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-20 09:38:38,079 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse1))) (or (let ((.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select .cse3 .cse2))) (and (not (= .cse0 .cse1)) (<= (+ .cse0 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) 0) (not (= .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| (Array Int (Array Int Int)))) (let ((.cse5 (+ (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select .cse3 .cse5)) (.cse6 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_#memory_$Pointer$.offset|))) (and (<= (+ 2 .cse4) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse4 .cse1)) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse1) .cse5)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)) |c_#memory_$Pointer$.offset|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse4)) (= .cse6 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-20 09:38:39,344 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-20 09:38:39,345 INFO L350 Elim1Store]: Elim1 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 160 treesize of output 133 [2022-11-20 09:38:39,381 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-20 09:38:39,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 99 [2022-11-20 09:38:39,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:38:39,610 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 09:38:39,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 110 [2022-11-20 09:38:39,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:38:39,633 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-11-20 09:38:39,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 115 [2022-11-20 09:38:40,369 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 09:38:40,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 61 [2022-11-20 09:38:41,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:38:41,025 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 09:38:41,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 29 [2022-11-20 09:38:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:38:41,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:38:41,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-11-20 09:38:42,215 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)))))))) is different from false [2022-11-20 09:38:42,232 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (Array Int Int))) (let ((.cse1 (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|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_8068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)))))))) is different from false [2022-11-20 09:38:42,275 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |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.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_#t~mem10#1.base| v_ArrVal_8068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ 4 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)))))))) is different from false [2022-11-20 09:38:42,295 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (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 ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .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.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ 4 .cse0)))))))))) is different from false [2022-11-20 09:38:42,342 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (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 ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .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.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select (select .cse0 .cse2) .cse3))) (or (<= 0 (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (+ .cse4 4))) (not (<= 0 .cse4))))))))) is different from false [2022-11-20 09:38:42,363 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (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$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 4) |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8070)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8068) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)))))))))) is different from false [2022-11-20 09:38:42,410 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8068 (Array Int Int)) (v_ArrVal_8069 (Array Int Int)) (v_ArrVal_8070 (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$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 4) |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_8070)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8068) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_8069))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (or (not (<= 0 .cse0)) (<= 0 (select (select .cse1 (select (select .cse2 .cse3) .cse4)) (+ .cse0 4)))))))))) is different from false [2022-11-20 09:38:43,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519358631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:38:43,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:38:43,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 64 [2022-11-20 09:38:43,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164488187] [2022-11-20 09:38:43,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:38:43,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-20 09:38:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:38:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-20 09:38:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=5192, Unknown=9, NotChecked=1208, Total=6642 [2022-11-20 09:38:43,005 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 65 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 56 states have internal predecessors, (129), 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) [2022-11-20 09:38:46,799 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse13)) (.cse25 (+ .cse3 4))) (let ((.cse22 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse19 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse24 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse10 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse18 (select |c_#memory_$Pointer$.offset| .cse13)) (.cse11 (select .cse16 .cse25))) (let ((.cse0 (not (= .cse11 .cse13))) (.cse1 (= (select .cse18 .cse25) 0)) (.cse5 (select .cse24 .cse10)) (.cse7 (select .cse16 4)) (.cse17 (select .cse23 4)) (.cse21 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse6 (select .cse24 4)) (.cse20 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse19)) (.cse4 (select .cse23 .cse22)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (= .cse3 0) (not (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse5 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| .cse7) 1) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse9 .cse10) 0) (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (or (and .cse0 (<= (+ .cse11 2) |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (not (= .cse11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| (Array Int (Array Int Int)))) (let ((.cse14 (+ (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse12 (select .cse16 .cse14)) (.cse15 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_#memory_$Pointer$.offset|))) (and (<= (+ 2 .cse12) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse12 .cse13)) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse13) .cse14)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse15 (select |c_#memory_$Pointer$.offset| .cse15)) |c_#memory_$Pointer$.offset|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)) (= .cse15 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)))))) (not (= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse18 4) 0) (not (= .cse7 .cse13)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse19) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ .cse4 1) |c_#StackHeapBarrier|) (= (select |c_#valid| .cse11) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= (select .cse20 4) 0) (= (select |c_#valid| .cse5) 1) (<= (+ .cse5 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse13)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse11 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (not (= .cse21 .cse2)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (= (select |c_#valid| .cse13) 1) (not (= .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|)) (= (select |c_#valid| .cse17) 1) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse21 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse21)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse6) 1) (<= (+ .cse8 1) |c_#StackHeapBarrier|) (= (select .cse20 .cse22) 0) (= (select |c_#valid| .cse8) 1) (= (select |c_#valid| .cse4) 1) (= (select .cse9 4) 0)))))) is different from false [2022-11-20 09:38:46,815 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse16 (select |c_#memory_$Pointer$.base| .cse13)) (.cse25 (+ .cse3 4))) (let ((.cse22 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse19 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse23 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse24 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse10 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse18 (select |c_#memory_$Pointer$.offset| .cse13)) (.cse11 (select .cse16 .cse25))) (let ((.cse0 (not (= .cse11 .cse13))) (.cse1 (= (select .cse18 .cse25) 0)) (.cse5 (select .cse24 .cse10)) (.cse7 (select .cse16 4)) (.cse17 (select .cse23 4)) (.cse21 (select (select |c_#memory_$Pointer$.base| .cse2) 4)) (.cse6 (select .cse24 4)) (.cse20 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse19)) (.cse4 (select .cse23 .cse22)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= |c_ULTIMATE.start_dll_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|)) (= .cse3 0) (not (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse5 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| .cse7) 1) (not (= .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select .cse9 .cse10) 0) (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (or (and .cse0 (<= (+ .cse11 2) |c_ULTIMATE.start_main_~#s~0#1.base|) .cse1 (not (= .cse11 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| (Array Int (Array Int Int)))) (let ((.cse14 (+ (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse12 (select .cse16 .cse14)) (.cse15 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| |c_#memory_$Pointer$.offset|))) (and (<= (+ 2 .cse12) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse12 .cse13)) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse13) .cse14)) (= (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_76| .cse15 (select |c_#memory_$Pointer$.offset| .cse15)) |c_#memory_$Pointer$.offset|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)) (= .cse15 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)))))) (not (= .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select .cse18 4) 0) (not (= .cse7 .cse13)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse19) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ .cse4 1) |c_#StackHeapBarrier|) (= (select |c_#valid| .cse11) 1) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.offset| 0) (= (select .cse20 4) 0) (= (select |c_#valid| .cse5) 1) (<= (+ .cse5 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse13)) (<= (+ |c_ULTIMATE.start_dll_append_#t~ret7#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ .cse11 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse2)) (not (= .cse21 .cse2)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (= (select |c_#valid| .cse13) 1) (not (= .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|)) (= (select |c_#valid| .cse17) 1) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse21 |c_ULTIMATE.start_dll_append_~head#1.base|)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse21)) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse6) 1) (<= (+ .cse8 1) |c_#StackHeapBarrier|) (= (select .cse20 .cse22) 0) (= (select |c_#valid| .cse8) 1) (= (select |c_#valid| .cse4) 1) (= (select .cse9 4) 0)))))) is different from true [2022-11-20 09:38:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:38:49,863 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-11-20 09:38:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-20 09:38:49,864 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 56 states have internal predecessors, (129), 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) Word has length 78 [2022-11-20 09:38:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:38:49,865 INFO L225 Difference]: With dead ends: 115 [2022-11-20 09:38:49,865 INFO L226 Difference]: Without dead ends: 115 [2022-11-20 09:38:49,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 104 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=494, Invalid=8843, Unknown=11, NotChecked=1782, Total=11130 [2022-11-20 09:38:49,867 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 167 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:38:49,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1758 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1840 Invalid, 0 Unknown, 199 Unchecked, 2.3s Time] [2022-11-20 09:38:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-20 09:38:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 95. [2022-11-20 09:38:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 90 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-20 09:38:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-11-20 09:38:49,872 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 78 [2022-11-20 09:38:49,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:38:49,872 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-11-20 09:38:49,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 56 states have internal predecessors, (129), 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) [2022-11-20 09:38:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-11-20 09:38:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-20 09:38:49,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:38:49,874 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:38:49,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-20 09:38:50,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-20 09:38:50,083 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 09:38:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:38:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1990095940, now seen corresponding path program 2 times [2022-11-20 09:38:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:38:50,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587503156] [2022-11-20 09:38:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:38:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:38:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:55,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:38:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:55,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:38:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:56,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:38:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:38:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:38:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:38:58,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587503156] [2022-11-20 09:38:58,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587503156] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:38:58,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678742391] [2022-11-20 09:38:58,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:38:58,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:38:58,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:38:58,072 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:38:58,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-20 09:38:58,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:38:58,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:38:58,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 193 conjunts are in the unsatisfiable core [2022-11-20 09:38:58,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:38:58,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:38:58,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:38:59,211 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:38:59,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:39:00,096 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:39:00,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:39:00,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:39:00,599 INFO L350 Elim1Store]: Elim1 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-20 09:39:00,856 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:39:00,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2022-11-20 09:39:00,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 09:39:01,701 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 09:39:01,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 39 [2022-11-20 09:39:01,721 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 09:39:01,722 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2022-11-20 09:39:01,728 INFO L350 Elim1Store]: Elim1 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-20 09:39:02,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:39:02,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:39:02,649 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-20 09:39:02,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 83 [2022-11-20 09:39:02,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:39:02,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:39:02,665 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 09:39:02,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 77 [2022-11-20 09:39:02,704 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-20 09:39:02,704 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 36 [2022-11-20 09:39:05,132 INFO L321 Elim1Store]: treesize reduction 114, result has 15.6 percent of original size [2022-11-20 09:39:05,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 234 treesize of output 104 [2022-11-20 09:39:05,177 INFO L321 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-11-20 09:39:05,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 133 [2022-11-20 09:39:05,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 09:39:05,568 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-20 09:39:05,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 312 treesize of output 179 [2022-11-20 09:39:05,619 INFO L321 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2022-11-20 09:39:05,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 280 treesize of output 256 [2022-11-20 09:39:05,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:39:05,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 74 [2022-11-20 09:39:08,298 INFO L321 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2022-11-20 09:39:08,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 271 treesize of output 99 [2022-11-20 09:39:08,332 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-20 09:39:08,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2022-11-20 09:39:08,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 09:39:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:39:08,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:39:10,437 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8368 (Array Int Int)) (v_ArrVal_8374 Int) (v_ArrVal_8371 (Array Int Int)) (v_ArrVal_8372 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse5 (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|) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8372)) (.cse2 (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|) .cse8 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_8371))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ 4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse0 (select (select .cse5 .cse6) .cse7))) (or (<= (+ .cse0 1) 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ .cse0 4))) (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_8368))) (store .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_8374))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))))) is different from false [2022-11-20 09:39:13,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:39:13,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1383 treesize of output 1376 [2022-11-20 09:39:13,920 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:39:13,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23232 treesize of output 21928 [2022-11-20 09:39:13,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26504 treesize of output 21940 [2022-11-20 09:39:14,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:39:14,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8605 treesize of output 7957 [2022-11-20 09:39:14,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:39:14,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21287 treesize of output 19335 [2022-11-20 09:39:56,824 WARN L233 SmtUtils]: Spent 25.08s on a formula simplification. DAG size of input: 101 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:39:56,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678742391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:39:56,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:39:56,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 42] total 81 [2022-11-20 09:39:56,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173925706] [2022-11-20 09:39:56,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:39:56,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-20 09:39:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:39:56,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-20 09:39:56,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=8429, Unknown=64, NotChecked=184, Total=8930 [2022-11-20 09:39:56,831 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 81 states, 79 states have (on average 1.7848101265822784) internal successors, (141), 72 states have internal predecessors, (141), 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-20 09:40:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:40:15,244 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-11-20 09:40:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-20 09:40:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 79 states have (on average 1.7848101265822784) internal successors, (141), 72 states have internal predecessors, (141), 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 80 [2022-11-20 09:40:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:40:15,246 INFO L225 Difference]: With dead ends: 119 [2022-11-20 09:40:15,246 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 09:40:15,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 122 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 71.4s TimeCoverageRelationStatistics Valid=557, Invalid=14380, Unknown=73, NotChecked=242, Total=15252 [2022-11-20 09:40:15,248 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 187 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:40:15,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 2105 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2853 Invalid, 0 Unknown, 122 Unchecked, 4.2s Time] [2022-11-20 09:40:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 09:40:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2022-11-20 09:40:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.2) internal successors, (96), 91 states have internal predecessors, (96), 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-20 09:40:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-11-20 09:40:15,252 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 80 [2022-11-20 09:40:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:40:15,252 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-11-20 09:40:15,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 79 states have (on average 1.7848101265822784) internal successors, (141), 72 states have internal predecessors, (141), 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-20 09:40:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-11-20 09:40:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-20 09:40:15,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:40:15,254 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:40:15,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-20 09:40:15,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:40:15,463 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2022-11-20 09:40:15,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:40:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1990140642, now seen corresponding path program 2 times [2022-11-20 09:40:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:40:15,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824595795] [2022-11-20 09:40:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:40:15,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:40:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:40:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 09:40:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:40:21,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:40:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:40:21,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-20 09:40:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:40:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 09:40:23,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:40:23,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824595795] [2022-11-20 09:40:23,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824595795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:40:23,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094399197] [2022-11-20 09:40:23,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:40:23,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:40:23,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:40:23,043 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:40:23,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25d2cb0b-6a80-49a1-883f-4b9a058f17e2/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-20 09:40:23,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:40:23,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:40:23,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 183 conjunts are in the unsatisfiable core [2022-11-20 09:40:23,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:40:24,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:40:25,134 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:40:25,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:40:25,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:40:25,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 09:40:25,848 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:40:25,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2022-11-20 09:40:25,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 09:40:26,699 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-20 09:40:26,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 36 [2022-11-20 09:40:26,721 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-20 09:40:26,721 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 18 [2022-11-20 09:40:26,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 09:40:28,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:40:28,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:40:28,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:40:28,119 INFO L321 Elim1Store]: treesize reduction 172, result has 7.0 percent of original size [2022-11-20 09:40:28,119 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 77 [2022-11-20 09:40:28,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:40:28,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:40:28,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:40:28,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:40:28,145 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 09:40:28,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 96 [2022-11-20 09:40:28,207 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-20 09:40:28,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 09:40:31,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:40:31,477 INFO L321 Elim1Store]: treesize reduction 166, result has 14.4 percent of original size [2022-11-20 09:40:31,478 INFO L350 Elim1Store]: Elim1 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 8 case distinctions, treesize of input 254 treesize of output 127 [2022-11-20 09:40:31,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:40:31,544 INFO L321 Elim1Store]: treesize reduction 152, result has 14.6 percent of original size [2022-11-20 09:40:31,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 205 treesize of output 144 [2022-11-20 09:40:31,998 INFO L321 Elim1Store]: treesize reduction 170, result has 19.4 percent of original size [2022-11-20 09:40:31,998 INFO L350 Elim1Store]: Elim1 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 330 treesize of output 137 [2022-11-20 09:40:32,095 INFO L321 Elim1Store]: treesize reduction 172, result has 16.1 percent of original size [2022-11-20 09:40:32,096 INFO L350 Elim1Store]: Elim1 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 287 treesize of output 228 [2022-11-20 09:40:50,883 WARN L233 SmtUtils]: Spent 9.91s on a formula simplification. DAG size of input: 652 DAG size of output: 604 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 09:40:50,887 INFO L321 Elim1Store]: treesize reduction 288, result has 85.8 percent of original size [2022-11-20 09:40:50,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 1 disjoint index pairs (out of 171 index pairs), introduced 33 new quantified variables, introduced 171 case distinctions, treesize of input 1141 treesize of output 2177 [2022-11-20 09:40:51,377 INFO L217 Elim1Store]: Index analysis took 252 ms [2022-11-20 09:41:38,919 WARN L233 SmtUtils]: Spent 47.53s on a formula simplification. DAG size of input: 912 DAG size of output: 804 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 09:41:38,922 INFO L321 Elim1Store]: treesize reduction 652, result has 74.9 percent of original size [2022-11-20 09:41:38,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 23 select indices, 23 select index equivalence classes, 1 disjoint index pairs (out of 253 index pairs), introduced 31 new quantified variables, introduced 253 case distinctions, treesize of input 2357 treesize of output 3375