./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:35:45,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:35:45,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:35:45,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:35:45,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:35:45,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:35:45,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:35:45,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:35:45,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:35:45,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:35:45,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:35:45,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:35:45,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:35:45,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:35:45,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:35:45,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:35:45,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:35:45,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:35:45,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:35:45,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:35:45,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:35:45,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:35:45,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:35:45,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:35:45,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:35:45,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:35:45,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:35:45,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:35:45,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:35:45,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:35:45,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:35:45,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:35:45,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:35:45,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:35:45,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:35:45,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:35:45,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:35:45,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:35:45,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:35:45,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:35:45,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:35:45,321 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:35:45,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:35:45,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:35:45,378 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:35:45,378 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:35:45,379 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:35:45,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:35:45,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:35:45,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:35:45,381 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:35:45,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:35:45,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:35:45,384 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:35:45,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:35:45,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:35:45,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:35:45,385 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:35:45,385 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:35:45,385 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:35:45,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:35:45,386 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:35:45,386 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:35:45,387 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:35:45,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:35:45,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:35:45,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:35:45,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:35:45,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:35:45,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:35:45,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:35:45,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:35:45,391 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_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2022-11-16 12:35:45,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:35:45,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:35:45,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:35:45,766 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:35:45,767 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:35:45,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-11-16 12:35:45,872 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/data/b837d96ee/dfacad3a87294f799493fe538e4a5a18/FLAG337cc5818 [2022-11-16 12:35:46,636 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:35:46,637 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-11-16 12:35:46,657 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/data/b837d96ee/dfacad3a87294f799493fe538e4a5a18/FLAG337cc5818 [2022-11-16 12:35:46,880 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/data/b837d96ee/dfacad3a87294f799493fe538e4a5a18 [2022-11-16 12:35:46,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:35:46,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:35:46,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:35:46,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:35:46,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:35:46,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:35:46" (1/1) ... [2022-11-16 12:35:46,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284ff004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:46, skipping insertion in model container [2022-11-16 12:35:46,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:35:46" (1/1) ... [2022-11-16 12:35:46,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:35:46,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:35:47,408 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2022-11-16 12:35:47,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:35:47,438 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:35:47,536 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2022-11-16 12:35:47,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:35:47,582 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:35:47,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47 WrapperNode [2022-11-16 12:35:47,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:35:47,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:35:47,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:35:47,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:35:47,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,692 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-11-16 12:35:47,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:35:47,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:35:47,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:35:47,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:35:47,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,765 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:35:47,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:35:47,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:35:47,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:35:47,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (1/1) ... [2022-11-16 12:35:47,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:35:47,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:47,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:35:47,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:35:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:35:47,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:35:47,883 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 12:35:47,884 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 12:35:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:35:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:35:47,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:35:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:35:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:35:47,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:35:47,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:35:47,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:35:47,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:35:47,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:35:48,070 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:35:48,072 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:35:48,699 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:35:48,708 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:35:48,708 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 12:35:48,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:48 BoogieIcfgContainer [2022-11-16 12:35:48,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:35:48,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:35:48,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:35:48,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:35:48,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:35:46" (1/3) ... [2022-11-16 12:35:48,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb87b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:35:48, skipping insertion in model container [2022-11-16 12:35:48,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:35:47" (2/3) ... [2022-11-16 12:35:48,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb87b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:35:48, skipping insertion in model container [2022-11-16 12:35:48,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:35:48" (3/3) ... [2022-11-16 12:35:48,726 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2022-11-16 12:35:48,750 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:35:48,751 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-11-16 12:35:48,848 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:35:48,859 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;@64bb7a11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:35:48,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-11-16 12:35:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:35:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:35:48,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:48,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:35:48,881 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:35:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:48,890 INFO L85 PathProgramCache]: Analyzing trace with hash 895521621, now seen corresponding path program 1 times [2022-11-16 12:35:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:48,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526103472] [2022-11-16 12:35:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:49,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:49,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526103472] [2022-11-16 12:35:49,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526103472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:49,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:49,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:35:49,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375387923] [2022-11-16 12:35:49,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:49,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:35:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:49,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:35:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:35:49,379 INFO L87 Difference]: Start difference. First operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:49,672 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-11-16 12:35:49,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:35:49,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:35:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:49,688 INFO L225 Difference]: With dead ends: 125 [2022-11-16 12:35:49,688 INFO L226 Difference]: Without dead ends: 122 [2022-11-16 12:35:49,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:35:49,695 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:49,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 197 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:35:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-16 12:35:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-16 12:35:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.953125) internal successors, (125), 117 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:35:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2022-11-16 12:35:49,754 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 6 [2022-11-16 12:35:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:49,754 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2022-11-16 12:35:49,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2022-11-16 12:35:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:35:49,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:49,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:35:49,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:35:49,757 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:35:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash 895521622, now seen corresponding path program 1 times [2022-11-16 12:35:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:49,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105423810] [2022-11-16 12:35:49,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:49,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:49,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105423810] [2022-11-16 12:35:49,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105423810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:49,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:49,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:35:49,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869031982] [2022-11-16 12:35:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:49,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:35:49,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:49,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:35:49,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:35:49,895 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:50,029 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2022-11-16 12:35:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:35:50,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:35:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:50,032 INFO L225 Difference]: With dead ends: 120 [2022-11-16 12:35:50,032 INFO L226 Difference]: Without dead ends: 120 [2022-11-16 12:35:50,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:35:50,034 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:50,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:35:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-16 12:35:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-16 12:35:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.921875) internal successors, (123), 115 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:35:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-11-16 12:35:50,050 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 6 [2022-11-16 12:35:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:50,051 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-11-16 12:35:50,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:35:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-11-16 12:35:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:35:50,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:50,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:50,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:35:50,053 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:35:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 164994135, now seen corresponding path program 1 times [2022-11-16 12:35:50,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:50,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715062066] [2022-11-16 12:35:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:50,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:35:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:50,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:50,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715062066] [2022-11-16 12:35:50,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715062066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:50,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:50,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:35:50,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434198563] [2022-11-16 12:35:50,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:50,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:35:50,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:50,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:35:50,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:35:50,363 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:35:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:50,604 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-11-16 12:35:50,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:35:50,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-16 12:35:50,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:50,611 INFO L225 Difference]: With dead ends: 127 [2022-11-16 12:35:50,611 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 12:35:50,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:35:50,613 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 5 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:50,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:35:50,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 12:35:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2022-11-16 12:35:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 116 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:35:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2022-11-16 12:35:50,636 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 13 [2022-11-16 12:35:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:50,636 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2022-11-16 12:35:50,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:35:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2022-11-16 12:35:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:35:50,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:50,638 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:50,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:35:50,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:35:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453220, now seen corresponding path program 1 times [2022-11-16 12:35:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:50,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391851494] [2022-11-16 12:35:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:50,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:35:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:50,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:35:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:35:51,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:51,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391851494] [2022-11-16 12:35:51,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391851494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:51,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:51,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:35:51,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171663001] [2022-11-16 12:35:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:51,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:35:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:51,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:35:51,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:35:51,015 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:35:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:51,455 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-11-16 12:35:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:35:51,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-16 12:35:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:51,460 INFO L225 Difference]: With dead ends: 121 [2022-11-16 12:35:51,460 INFO L226 Difference]: Without dead ends: 121 [2022-11-16 12:35:51,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:35:51,462 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 13 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:51,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 419 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:35:51,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-16 12:35:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2022-11-16 12:35:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 115 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:35:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-11-16 12:35:51,473 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 22 [2022-11-16 12:35:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:51,473 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-11-16 12:35:51,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:35:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-11-16 12:35:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:35:51,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:51,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:51,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:35:51,475 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:35:51,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:51,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453219, now seen corresponding path program 1 times [2022-11-16 12:35:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:51,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273198512] [2022-11-16 12:35:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:51,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:35:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:35:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:51,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:51,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273198512] [2022-11-16 12:35:51,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273198512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:35:51,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:35:51,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:35:51,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005382917] [2022-11-16 12:35:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:35:51,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:35:51,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:51,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:35:51,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:35:51,832 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:35:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:52,254 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-11-16 12:35:52,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:35:52,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-16 12:35:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:52,260 INFO L225 Difference]: With dead ends: 120 [2022-11-16 12:35:52,261 INFO L226 Difference]: Without dead ends: 120 [2022-11-16 12:35:52,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:35:52,262 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 11 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:52,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 443 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:35:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-16 12:35:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-11-16 12:35:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.876923076923077) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:35:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2022-11-16 12:35:52,271 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 22 [2022-11-16 12:35:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:52,272 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2022-11-16 12:35:52,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:35:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2022-11-16 12:35:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:35:52,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:52,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:52,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:35:52,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:35:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:52,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296005, now seen corresponding path program 1 times [2022-11-16 12:35:52,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:52,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67571360] [2022-11-16 12:35:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:52,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:35:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:35:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:35:52,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67571360] [2022-11-16 12:35:52,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67571360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:52,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802356114] [2022-11-16 12:35:52,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:52,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:52,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:52,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:52,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:35:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:53,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 12:35:53,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:53,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:35:53,232 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2022-11-16 12:35:53,273 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2022-11-16 12:35:53,314 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:35:53,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 12:35:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-16 12:35:53,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:53,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802356114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:35:53,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:35:53,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-11-16 12:35:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685413051] [2022-11-16 12:35:53,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:53,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:35:53,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:53,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:35:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2022-11-16 12:35:53,885 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:35:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:54,367 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-11-16 12:35:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:35:54,368 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-16 12:35:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:54,370 INFO L225 Difference]: With dead ends: 125 [2022-11-16 12:35:54,370 INFO L226 Difference]: Without dead ends: 125 [2022-11-16 12:35:54,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=304, Unknown=2, NotChecked=74, Total=462 [2022-11-16 12:35:54,372 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 32 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:54,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 665 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 411 Invalid, 0 Unknown, 385 Unchecked, 0.4s Time] [2022-11-16 12:35:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-16 12:35:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-16 12:35:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.7887323943661972) internal successors, (127), 119 states have internal predecessors, (127), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:35:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-11-16 12:35:54,381 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 25 [2022-11-16 12:35:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:54,382 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-11-16 12:35:54,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:35:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-11-16 12:35:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:35:54,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:54,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:54,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:35:54,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:54,591 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:35:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296006, now seen corresponding path program 1 times [2022-11-16 12:35:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:54,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46128905] [2022-11-16 12:35:54,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:54,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:35:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:35:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:35:55,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:55,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46128905] [2022-11-16 12:35:55,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46128905] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:55,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057309543] [2022-11-16 12:35:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:55,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:55,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:55,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:55,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:35:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:55,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 12:35:55,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:55,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:35:55,775 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:35:55,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:35:55,786 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 11 [2022-11-16 12:35:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:35:55,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:56,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057309543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:56,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:35:56,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-11-16 12:35:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785670669] [2022-11-16 12:35:56,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:56,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 12:35:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:56,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 12:35:56,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:35:56,108 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 12:35:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:57,064 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-11-16 12:35:57,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:35:57,065 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-11-16 12:35:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:57,066 INFO L225 Difference]: With dead ends: 126 [2022-11-16 12:35:57,066 INFO L226 Difference]: Without dead ends: 126 [2022-11-16 12:35:57,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-11-16 12:35:57,068 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 126 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:57,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 706 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 12:35:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-16 12:35:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-11-16 12:35:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 118 states have internal predecessors, (126), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:35:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-11-16 12:35:57,075 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 25 [2022-11-16 12:35:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:57,087 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-11-16 12:35:57,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 12:35:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-11-16 12:35:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:35:57,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:57,089 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:57,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:35:57,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 12:35:57,290 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:35:57,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:57,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704927, now seen corresponding path program 1 times [2022-11-16 12:35:57,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:57,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664598599] [2022-11-16 12:35:57,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:57,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:35:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:57,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:35:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:57,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:35:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:35:58,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:35:58,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664598599] [2022-11-16 12:35:58,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664598599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:58,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411386562] [2022-11-16 12:35:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:58,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:58,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:35:58,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:35:58,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:35:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:35:58,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 12:35:58,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:35:58,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:35:58,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:35:58,294 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:35:58,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:35:58,396 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-16 12:35:58,412 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_522))) is different from true [2022-11-16 12:35:58,433 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_522))) is different from true [2022-11-16 12:35:58,456 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:35:58,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 12:35:58,529 WARN L855 $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-16 12:35:58,563 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:35:58,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:35:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-16 12:35:58,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:35:59,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411386562] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:35:59,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:35:59,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2022-11-16 12:35:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228701022] [2022-11-16 12:35:59,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:35:59,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:35:59,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:35:59,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:35:59,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2022-11-16 12:35:59,143 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 12:35:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:59,735 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2022-11-16 12:35:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:35:59,736 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-16 12:35:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:59,737 INFO L225 Difference]: With dead ends: 137 [2022-11-16 12:35:59,737 INFO L226 Difference]: Without dead ends: 137 [2022-11-16 12:35:59,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=368, Unknown=4, NotChecked=172, Total=650 [2022-11-16 12:35:59,738 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 263 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:59,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 426 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 445 Invalid, 0 Unknown, 530 Unchecked, 0.4s Time] [2022-11-16 12:35:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-16 12:35:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 116. [2022-11-16 12:35:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 110 states have internal predecessors, (118), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:35:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2022-11-16 12:35:59,745 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 37 [2022-11-16 12:35:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:59,745 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2022-11-16 12:35:59,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-16 12:35:59,746 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2022-11-16 12:35:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 12:35:59,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:59,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:35:59,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 12:35:59,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:59,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:35:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704928, now seen corresponding path program 1 times [2022-11-16 12:35:59,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:59,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117284549] [2022-11-16 12:35:59,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:00,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:00,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:00,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:36:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:00,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117284549] [2022-11-16 12:36:00,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117284549] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:00,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073826938] [2022-11-16 12:36:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:00,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:00,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:00,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:00,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:36:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:01,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 12:36:01,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:01,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:36:01,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:36:01,143 WARN L855 $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_686 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_686) |c_#length|)))) is different from true [2022-11-16 12:36:01,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:01,196 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-16 12:36:01,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:36:01,244 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_687 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_687))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:36:01,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:01,313 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-16 12:36:01,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:36:01,423 WARN L855 $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))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-16 12:36:01,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:01,474 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-16 12:36:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-16 12:36:01,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:36:01,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073826938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:01,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:36:01,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2022-11-16 12:36:01,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98704212] [2022-11-16 12:36:01,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:36:01,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:36:01,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:36:01,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=171, Unknown=3, NotChecked=84, Total=306 [2022-11-16 12:36:01,650 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:36:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:02,178 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-11-16 12:36:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:36:02,179 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-11-16 12:36:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:02,180 INFO L225 Difference]: With dead ends: 125 [2022-11-16 12:36:02,180 INFO L226 Difference]: Without dead ends: 125 [2022-11-16 12:36:02,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=243, Unknown=3, NotChecked=102, Total=420 [2022-11-16 12:36:02,181 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 267 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:02,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 223 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 321 Invalid, 0 Unknown, 306 Unchecked, 0.4s Time] [2022-11-16 12:36:02,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-16 12:36:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-11-16 12:36:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 101 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:36:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-11-16 12:36:02,188 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 37 [2022-11-16 12:36:02,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:02,189 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-11-16 12:36:02,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:36:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-11-16 12:36:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 12:36:02,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:02,191 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:02,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:36:02,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:02,408 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990998, now seen corresponding path program 1 times [2022-11-16 12:36:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:02,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323777354] [2022-11-16 12:36:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:02,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 12:36:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:02,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323777354] [2022-11-16 12:36:02,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323777354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:36:02,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:36:02,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:36:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397623232] [2022-11-16 12:36:02,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:36:02,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:36:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:02,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:36:02,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:36:02,596 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:36:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:02,825 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-11-16 12:36:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:36:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-16 12:36:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:02,827 INFO L225 Difference]: With dead ends: 123 [2022-11-16 12:36:02,827 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 12:36:02,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-16 12:36:02,828 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:02,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 289 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:36:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 12:36:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-11-16 12:36:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:36:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-11-16 12:36:02,832 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 40 [2022-11-16 12:36:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:02,832 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-11-16 12:36:02,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:36:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-11-16 12:36:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 12:36:02,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:02,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:02,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:36:02,834 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990997, now seen corresponding path program 1 times [2022-11-16 12:36:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:02,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651216241] [2022-11-16 12:36:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:02,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:03,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:03,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:03,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:36:03,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:03,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651216241] [2022-11-16 12:36:03,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651216241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:36:03,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:36:03,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:36:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141770436] [2022-11-16 12:36:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:36:03,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:36:03,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:03,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:36:03,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:36:03,188 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:36:03,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:03,427 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-11-16 12:36:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:36:03,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-16 12:36:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:03,429 INFO L225 Difference]: With dead ends: 103 [2022-11-16 12:36:03,429 INFO L226 Difference]: Without dead ends: 103 [2022-11-16 12:36:03,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:36:03,430 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 79 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:03,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 304 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:36:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-16 12:36:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-16 12:36:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 97 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:36:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-11-16 12:36:03,434 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 40 [2022-11-16 12:36:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:03,434 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-11-16 12:36:03,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-16 12:36:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-11-16 12:36:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:36:03,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:03,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:36:03,436 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801691, now seen corresponding path program 1 times [2022-11-16 12:36:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:03,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668980344] [2022-11-16 12:36:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:03,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:03,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:03,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:04,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:36:04,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:04,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668980344] [2022-11-16 12:36:04,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668980344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:04,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315856257] [2022-11-16 12:36:04,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:04,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:04,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:04,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:04,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:36:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:04,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 12:36:04,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:04,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 9 treesize of output 5 [2022-11-16 12:36:04,865 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1056 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1056))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-16 12:36:04,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:04,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:36:04,915 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 12:36:04,915 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-16 12:36:05,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 12:36:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 12:36:05,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:36:05,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315856257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:36:05,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:36:05,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-16 12:36:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60297836] [2022-11-16 12:36:05,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:36:05,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:36:05,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:05,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:36:05,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-11-16 12:36:05,036 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:36:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:05,554 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-11-16 12:36:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:36:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-16 12:36:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:05,556 INFO L225 Difference]: With dead ends: 154 [2022-11-16 12:36:05,556 INFO L226 Difference]: Without dead ends: 154 [2022-11-16 12:36:05,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=703, Unknown=2, NotChecked=54, Total=870 [2022-11-16 12:36:05,557 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 77 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:05,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 843 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 573 Invalid, 0 Unknown, 318 Unchecked, 0.4s Time] [2022-11-16 12:36:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-16 12:36:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 102. [2022-11-16 12:36:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 96 states have internal predecessors, (105), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:36:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-11-16 12:36:05,561 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 41 [2022-11-16 12:36:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:05,561 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-11-16 12:36:05,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:36:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-11-16 12:36:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 12:36:05,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:05,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:05,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 12:36:05,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:05,763 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:05,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801690, now seen corresponding path program 1 times [2022-11-16 12:36:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:05,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65093178] [2022-11-16 12:36:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:06,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:06,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:07,197 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:36:07,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:07,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65093178] [2022-11-16 12:36:07,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65093178] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:07,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405209607] [2022-11-16 12:36:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:07,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:07,200 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:07,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:36:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:07,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-16 12:36:07,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:07,957 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-16 12:36:07,962 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-16 12:36:08,179 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1215 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1215))) (exists ((v_ArrVal_1211 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1211) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1214 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1214))))) is different from true [2022-11-16 12:36:08,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:08,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:36:08,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:08,246 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-16 12:36:08,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:08,253 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-16 12:36:08,265 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:36:08,266 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-16 12:36:08,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 12:36:08,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:36:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 12:36:08,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:36:09,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405209607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:09,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:36:09,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-11-16 12:36:09,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653785694] [2022-11-16 12:36:09,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:36:09,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 12:36:09,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 12:36:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2022-11-16 12:36:09,534 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:36:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:11,882 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2022-11-16 12:36:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 12:36:11,888 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-16 12:36:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:11,889 INFO L225 Difference]: With dead ends: 164 [2022-11-16 12:36:11,890 INFO L226 Difference]: Without dead ends: 164 [2022-11-16 12:36:11,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=232, Invalid=2217, Unknown=5, NotChecked=96, Total=2550 [2022-11-16 12:36:11,892 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 200 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:11,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1808 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1205 Invalid, 0 Unknown, 206 Unchecked, 1.3s Time] [2022-11-16 12:36:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-16 12:36:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 110. [2022-11-16 12:36:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.4125) internal successors, (113), 104 states have internal predecessors, (113), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:36:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-11-16 12:36:11,907 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 41 [2022-11-16 12:36:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:11,908 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-11-16 12:36:11,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:36:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-11-16 12:36:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:36:11,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:11,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:11,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:36:12,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 12:36:12,123 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:12,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2031121995, now seen corresponding path program 1 times [2022-11-16 12:36:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:12,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257728274] [2022-11-16 12:36:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:12,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:12,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-16 12:36:12,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:12,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257728274] [2022-11-16 12:36:12,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257728274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:36:12,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:36:12,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:36:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123490840] [2022-11-16 12:36:12,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:36:12,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:36:12,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:12,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:36:12,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:36:12,337 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:36:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:12,490 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-11-16 12:36:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:36:12,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-11-16 12:36:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:12,492 INFO L225 Difference]: With dead ends: 127 [2022-11-16 12:36:12,492 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 12:36:12,492 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-16 12:36:12,493 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 165 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:12,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 173 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:36:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 12:36:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2022-11-16 12:36:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.4) internal successors, (112), 103 states have internal predecessors, (112), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:36:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2022-11-16 12:36:12,497 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 42 [2022-11-16 12:36:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:12,498 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2022-11-16 12:36:12,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:36:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2022-11-16 12:36:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 12:36:12,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:12,499 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:12,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:36:12,500 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:12,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:12,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1993086700, now seen corresponding path program 1 times [2022-11-16 12:36:12,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:12,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558164242] [2022-11-16 12:36:12,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:12,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:13,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:13,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:36:13,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:13,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558164242] [2022-11-16 12:36:13,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558164242] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:13,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159640513] [2022-11-16 12:36:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:13,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:13,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:13,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:13,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:36:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:14,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 12:36:14,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:14,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 12:36:14,640 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1515 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1515) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:36:14,651 WARN L855 $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_1516 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1516))))) is different from true [2022-11-16 12:36:14,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:14,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-16 12:36:14,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-16 12:36:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-16 12:36:14,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:36:15,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159640513] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:15,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:36:15,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2022-11-16 12:36:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883391577] [2022-11-16 12:36:15,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:36:15,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 12:36:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:15,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 12:36:15,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1018, Unknown=7, NotChecked=130, Total=1260 [2022-11-16 12:36:15,020 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:36:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:16,286 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2022-11-16 12:36:16,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:36:16,292 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-11-16 12:36:16,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:16,295 INFO L225 Difference]: With dead ends: 108 [2022-11-16 12:36:16,295 INFO L226 Difference]: Without dead ends: 108 [2022-11-16 12:36:16,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=186, Invalid=1704, Unknown=10, NotChecked=170, Total=2070 [2022-11-16 12:36:16,299 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 72 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:16,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 928 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 656 Invalid, 0 Unknown, 192 Unchecked, 0.6s Time] [2022-11-16 12:36:16,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-16 12:36:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2022-11-16 12:36:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:36:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-11-16 12:36:16,305 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 44 [2022-11-16 12:36:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:16,305 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-11-16 12:36:16,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 12:36:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-11-16 12:36:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:36:16,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:16,307 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:16,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 12:36:16,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:36:16,514 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176968, now seen corresponding path program 1 times [2022-11-16 12:36:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:16,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038842824] [2022-11-16 12:36:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:16,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:17,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:18,665 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:36:18,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:18,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038842824] [2022-11-16 12:36:18,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038842824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:18,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912575534] [2022-11-16 12:36:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:18,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:18,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:18,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:18,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:36:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:18,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-16 12:36:18,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:19,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:36:19,430 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:36:19,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:36:19,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:36:19,853 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:36:19,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 12:36:20,169 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:36:20,169 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 47 treesize of output 22 [2022-11-16 12:36:20,180 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-16 12:36:20,187 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-16 12:36:20,423 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1684 (Array Int Int)) (v_ArrVal_1683 (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_1683)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1684) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 12:36:20,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:20,503 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:36:20,503 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 53 treesize of output 51 [2022-11-16 12:36:20,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:20,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 0 case distinctions, treesize of input 51 treesize of output 49 [2022-11-16 12:36:20,557 INFO L321 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2022-11-16 12:36:20,558 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 60 [2022-11-16 12:36:20,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2022-11-16 12:36:20,929 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:36:20,929 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 50 treesize of output 25 [2022-11-16 12:36:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:36:21,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:36:21,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912575534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:21,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:36:21,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-11-16 12:36:21,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095515083] [2022-11-16 12:36:21,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:36:21,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 12:36:21,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:21,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 12:36:21,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1918, Unknown=1, NotChecked=88, Total=2162 [2022-11-16 12:36:21,327 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 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-16 12:36:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:23,143 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2022-11-16 12:36:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:36:23,144 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 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 46 [2022-11-16 12:36:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:23,145 INFO L225 Difference]: With dead ends: 145 [2022-11-16 12:36:23,146 INFO L226 Difference]: Without dead ends: 145 [2022-11-16 12:36:23,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=260, Invalid=2823, Unknown=1, NotChecked=108, Total=3192 [2022-11-16 12:36:23,148 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 86 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:23,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1427 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1225 Invalid, 0 Unknown, 312 Unchecked, 1.1s Time] [2022-11-16 12:36:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-16 12:36:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2022-11-16 12:36:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 117 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:36:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2022-11-16 12:36:23,154 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 46 [2022-11-16 12:36:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:23,154 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2022-11-16 12:36:23,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 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-16 12:36:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2022-11-16 12:36:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 12:36:23,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:23,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:23,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-16 12:36:23,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 12:36:23,362 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:23,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176969, now seen corresponding path program 1 times [2022-11-16 12:36:23,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:23,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152789853] [2022-11-16 12:36:23,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:23,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:24,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:25,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:36:25,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:25,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152789853] [2022-11-16 12:36:25,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152789853] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:25,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79676767] [2022-11-16 12:36:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:25,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:25,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:25,999 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:26,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:36:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:26,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-16 12:36:26,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:26,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:36:26,815 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:36:26,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:36:27,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:36:27,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:36:27,318 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:36:27,319 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 47 treesize of output 44 [2022-11-16 12:36:27,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 12:36:27,701 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:36:27,702 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 79 treesize of output 38 [2022-11-16 12:36:27,711 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-11-16 12:36:28,026 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1858 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1858))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1861 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1861))) (exists ((v_ArrVal_1862 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1862))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 12:36:28,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:28,106 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:36:28,106 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 85 treesize of output 75 [2022-11-16 12:36:28,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:28,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:28,124 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 12:36:28,124 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 83 treesize of output 80 [2022-11-16 12:36:28,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:28,135 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 24 treesize of output 26 [2022-11-16 12:36:28,161 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-16 12:36:28,161 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 32 treesize of output 34 [2022-11-16 12:36:28,611 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:36:28,611 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 83 treesize of output 42 [2022-11-16 12:36:28,625 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-11-16 12:36:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:36:28,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:36:29,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79676767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:29,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:36:29,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2022-11-16 12:36:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638580425] [2022-11-16 12:36:29,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:36:29,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-16 12:36:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:29,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-16 12:36:29,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2907, Unknown=2, NotChecked=108, Total=3192 [2022-11-16 12:36:29,529 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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-16 12:36:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:33,063 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-11-16 12:36:33,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:36:33,064 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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 46 [2022-11-16 12:36:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:33,065 INFO L225 Difference]: With dead ends: 185 [2022-11-16 12:36:33,065 INFO L226 Difference]: Without dead ends: 185 [2022-11-16 12:36:33,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=312, Invalid=4520, Unknown=2, NotChecked=136, Total=4970 [2022-11-16 12:36:33,068 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 171 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 639 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:33,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 2285 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1463 Invalid, 0 Unknown, 639 Unchecked, 1.5s Time] [2022-11-16 12:36:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-16 12:36:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 124. [2022-11-16 12:36:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 116 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:36:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-11-16 12:36:33,074 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 46 [2022-11-16 12:36:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:33,075 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-11-16 12:36:33,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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-16 12:36:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-11-16 12:36:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:36:33,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:33,076 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-16 12:36:33,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:36:33,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 12:36:33,284 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1589162821, now seen corresponding path program 2 times [2022-11-16 12:36:33,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:33,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945440091] [2022-11-16 12:36:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:33,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:34,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:34,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:35,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:36:35,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:35,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945440091] [2022-11-16 12:36:35,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945440091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:35,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798232616] [2022-11-16 12:36:35,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:36:35,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:35,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:35,888 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:35,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:36:36,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:36:36,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:36:36,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-16 12:36:36,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:36,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:36:36,806 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:36:36,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:36:37,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:36:37,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 11 treesize of output 7 [2022-11-16 12:36:37,346 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 12:36:37,346 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 47 treesize of output 33 [2022-11-16 12:36:37,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 12:36:37,747 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-16 12:36:37,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 39 [2022-11-16 12:36:37,765 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-11-16 12:36:38,000 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2040 (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_2039) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2040) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 12:36:38,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:38,099 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-16 12:36:38,100 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 91 treesize of output 85 [2022-11-16 12:36:38,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:38,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:38,116 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 12:36:38,116 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 89 treesize of output 86 [2022-11-16 12:36:38,145 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-16 12:36:38,145 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 32 treesize of output 34 [2022-11-16 12:36:38,755 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 12:36:38,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 59 [2022-11-16 12:36:39,028 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-16 12:36:39,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2022-11-16 12:36:39,122 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:36:39,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:36:39,409 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-11-16 12:36:39,410 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 24 treesize of output 23 [2022-11-16 12:36:39,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_50| Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_50| v_ArrVal_2048)) (.cse2 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_50| v_ArrVal_2047))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select .cse4 .cse3) .cse1))) (or (not (< |v_node_create_~temp~0#1.base_50| |c_#StackHeapBarrier|)) (not (<= 0 .cse0)) (not (<= 0 .cse1)) (= (select (select .cse2 (select (select .cse2 .cse3) .cse1)) .cse0) .cse3) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_50|) 0))))))) is different from false [2022-11-16 12:36:39,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798232616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:39,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:36:39,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2022-11-16 12:36:39,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829477260] [2022-11-16 12:36:39,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:36:39,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-16 12:36:39,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:39,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-16 12:36:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3342, Unknown=2, NotChecked=234, Total=3782 [2022-11-16 12:36:39,752 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 54 states, 50 states have (on average 1.74) internal successors, (87), 47 states have internal predecessors, (87), 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-16 12:36:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:43,975 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-11-16 12:36:43,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:36:43,975 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 1.74) internal successors, (87), 47 states have internal predecessors, (87), 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 51 [2022-11-16 12:36:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:43,976 INFO L225 Difference]: With dead ends: 185 [2022-11-16 12:36:43,977 INFO L226 Difference]: Without dead ends: 185 [2022-11-16 12:36:43,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=411, Invalid=4997, Unknown=2, NotChecked=290, Total=5700 [2022-11-16 12:36:43,980 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 327 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:43,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1732 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1489 Invalid, 0 Unknown, 462 Unchecked, 1.5s Time] [2022-11-16 12:36:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-16 12:36:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 127. [2022-11-16 12:36:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.316326530612245) internal successors, (129), 119 states have internal predecessors, (129), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:36:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-11-16 12:36:43,999 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 51 [2022-11-16 12:36:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:44,000 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-11-16 12:36:44,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 1.74) internal successors, (87), 47 states have internal predecessors, (87), 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-16 12:36:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-11-16 12:36:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-16 12:36:44,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:44,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:44,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:36:44,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:36:44,210 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680377, now seen corresponding path program 1 times [2022-11-16 12:36:44,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:44,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885647369] [2022-11-16 12:36:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:44,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:45,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:45,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:36:45,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:45,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885647369] [2022-11-16 12:36:45,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885647369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:45,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924934735] [2022-11-16 12:36:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:45,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:45,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:45,536 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:45,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:36:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:45,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 12:36:45,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:46,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:36:46,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:36:46,379 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 12:36:46,379 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 25 treesize of output 20 [2022-11-16 12:36:46,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-16 12:36:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:36:46,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:36:46,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924934735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:36:46,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:36:46,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 29 [2022-11-16 12:36:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023476931] [2022-11-16 12:36:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:36:46,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:36:46,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:36:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2022-11-16 12:36:46,474 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:36:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:46,848 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-16 12:36:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:36:46,848 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-11-16 12:36:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:46,850 INFO L225 Difference]: With dead ends: 146 [2022-11-16 12:36:46,850 INFO L226 Difference]: Without dead ends: 146 [2022-11-16 12:36:46,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 12:36:46,851 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 291 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:46,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 347 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:36:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-16 12:36:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2022-11-16 12:36:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 118 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:36:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-11-16 12:36:46,864 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 52 [2022-11-16 12:36:46,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:46,864 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-11-16 12:36:46,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:36:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-11-16 12:36:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-16 12:36:46,866 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:46,866 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:46,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-16 12:36:47,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:47,072 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:47,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:47,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680376, now seen corresponding path program 1 times [2022-11-16 12:36:47,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:47,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818549739] [2022-11-16 12:36:47,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:48,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:36:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:48,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818549739] [2022-11-16 12:36:48,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818549739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:48,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916751653] [2022-11-16 12:36:48,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:48,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:48,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:48,889 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:48,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:36:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:49,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 12:36:49,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:49,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:36:49,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:36:49,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:36:49,780 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 12:36:49,781 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 25 treesize of output 20 [2022-11-16 12:36:49,803 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 12:36:49,803 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 23 treesize of output 18 [2022-11-16 12:36:49,931 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 12:36:49,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-11-16 12:36:49,942 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 12:36:49,942 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 26 treesize of output 10 [2022-11-16 12:36:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 12:36:50,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:36:50,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916751653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:36:50,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:36:50,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 31 [2022-11-16 12:36:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138213047] [2022-11-16 12:36:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:36:50,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:36:50,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:36:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2022-11-16 12:36:50,036 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:36:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:50,467 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-11-16 12:36:50,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:36:50,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-11-16 12:36:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:50,468 INFO L225 Difference]: With dead ends: 126 [2022-11-16 12:36:50,468 INFO L226 Difference]: Without dead ends: 126 [2022-11-16 12:36:50,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2022-11-16 12:36:50,470 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 145 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:50,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 358 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 264 Invalid, 0 Unknown, 18 Unchecked, 0.2s Time] [2022-11-16 12:36:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-16 12:36:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-11-16 12:36:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 116 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:36:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-11-16 12:36:50,475 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 52 [2022-11-16 12:36:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:50,481 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-11-16 12:36:50,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:36:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-11-16 12:36:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-16 12:36:50,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:50,483 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:50,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:36:50,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:50,684 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:50,685 INFO L85 PathProgramCache]: Analyzing trace with hash 965522297, now seen corresponding path program 1 times [2022-11-16 12:36:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:50,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922042827] [2022-11-16 12:36:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:50,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:51,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:52,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:36:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:36:52,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922042827] [2022-11-16 12:36:52,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922042827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126998777] [2022-11-16 12:36:52,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:52,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:52,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:52,576 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:52,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:36:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:52,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-16 12:36:52,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:52,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:36:53,249 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:36:53,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:36:53,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:36:53,618 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:36:53,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-16 12:36:53,874 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:36:53,875 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 30 treesize of output 17 [2022-11-16 12:36:53,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:36:53,889 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-16 12:36:54,081 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2640) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2639) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-16 12:36:54,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:54,145 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:36:54,146 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 36 treesize of output 40 [2022-11-16 12:36:54,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:36:54,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-11-16 12:36:54,174 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:36:54,174 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-16 12:36:54,251 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 35 treesize of output 23 [2022-11-16 12:36:54,415 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:36:54,415 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 35 treesize of output 18 [2022-11-16 12:36:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:36:54,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:36:54,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126998777] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:54,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:36:54,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 46 [2022-11-16 12:36:54,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019628661] [2022-11-16 12:36:54,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:36:54,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-16 12:36:54,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:54,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-16 12:36:54,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2290, Unknown=1, NotChecked=96, Total=2550 [2022-11-16 12:36:54,863 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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-16 12:36:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:57,358 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-11-16 12:36:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:36:57,359 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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 54 [2022-11-16 12:36:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:57,360 INFO L225 Difference]: With dead ends: 127 [2022-11-16 12:36:57,361 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 12:36:57,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=320, Invalid=3715, Unknown=1, NotChecked=124, Total=4160 [2022-11-16 12:36:57,364 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 254 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:57,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1583 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1493 Invalid, 0 Unknown, 96 Unchecked, 1.3s Time] [2022-11-16 12:36:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 12:36:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-11-16 12:36:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 116 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 12:36:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2022-11-16 12:36:57,370 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 54 [2022-11-16 12:36:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:57,370 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2022-11-16 12:36:57,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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-16 12:36:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2022-11-16 12:36:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 12:36:57,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:57,372 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:57,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:36:57,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:57,580 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2042113126, now seen corresponding path program 3 times [2022-11-16 12:36:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:57,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141642682] [2022-11-16 12:36:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:57,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:57,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:36:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:57,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:36:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:36:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:57,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 12:36:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:36:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-16 12:36:57,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:36:57,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141642682] [2022-11-16 12:36:57,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141642682] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:36:57,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450072892] [2022-11-16 12:36:57,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:36:57,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:36:57,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:36:57,750 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:36:57,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 12:36:58,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 12:36:58,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:36:58,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:36:58,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:36:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 12:36:58,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:36:58,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450072892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:36:58,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:36:58,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-16 12:36:58,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462307933] [2022-11-16 12:36:58,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:36:58,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:36:58,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:36:58,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:36:58,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:36:58,293 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:36:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:36:58,310 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-11-16 12:36:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:36:58,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-11-16 12:36:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:36:58,320 INFO L225 Difference]: With dead ends: 92 [2022-11-16 12:36:58,321 INFO L226 Difference]: Without dead ends: 92 [2022-11-16 12:36:58,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:36:58,323 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:36:58,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 99 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:36:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-16 12:36:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-16 12:36:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:36:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-11-16 12:36:58,329 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 58 [2022-11-16 12:36:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:36:58,330 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-11-16 12:36:58,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 12:36:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-11-16 12:36:58,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 12:36:58,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:36:58,331 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:36:58,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:36:58,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 12:36:58,540 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:36:58,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:36:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash -214738826, now seen corresponding path program 1 times [2022-11-16 12:36:58,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:36:58,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676612036] [2022-11-16 12:36:58,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:36:58,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:36:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:37:01,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:37:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:37:01,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:37:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:37:01,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:37:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:37:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:37:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:37:02,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676612036] [2022-11-16 12:37:02,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676612036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:37:02,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168239490] [2022-11-16 12:37:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:37:02,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:37:02,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:37:02,460 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:37:02,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 12:37:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:37:02,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 174 conjunts are in the unsatisfiable core [2022-11-16 12:37:02,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:37:02,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:37:03,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:37:03,570 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:37:03,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 12:37:03,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:37:03,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:37:04,114 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:37:04,114 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 36 treesize of output 35 [2022-11-16 12:37:04,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 12:37:04,573 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:37:04,574 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 48 treesize of output 27 [2022-11-16 12:37:04,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:37:04,597 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 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:37:04,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:37:05,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:05,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:05,407 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 12:37:05,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 55 [2022-11-16 12:37:05,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:05,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:05,441 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 12:37:05,441 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 38 [2022-11-16 12:37:05,479 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 12:37:05,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 12:37:07,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:07,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:07,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:37:07,137 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:37:07,137 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 27 [2022-11-16 12:37:07,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:07,908 INFO L321 Elim1Store]: treesize reduction 57, result has 21.9 percent of original size [2022-11-16 12:37:07,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 78 treesize of output 51 [2022-11-16 12:37:08,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:08,378 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 20 [2022-11-16 12:37:08,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:37:08,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:37:08,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:08,457 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 18 treesize of output 20 [2022-11-16 12:37:08,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:08,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 12:37:08,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 12:37:08,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:37:08,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:37:08,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-16 12:37:08,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:37:08,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:37:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:37:08,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:37:09,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3070 (Array Int Int)) (v_ArrVal_3071 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3071) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3070) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-16 12:37:09,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:37:09,173 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 45 treesize of output 46 [2022-11-16 12:37:09,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:37:09,189 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 84 treesize of output 87 [2022-11-16 12:37:09,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:37:09,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 64 [2022-11-16 12:37:09,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:37:09,218 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 114 treesize of output 113 [2022-11-16 12:37:09,227 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 98 treesize of output 94 [2022-11-16 12:37:09,236 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 48 treesize of output 44 [2022-11-16 12:37:10,502 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse47 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152) (+ v_arrayElimCell_151 4))))) (.cse25 (not .cse24))) (let ((.cse15 (or .cse25 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse66 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069)) (.cse67 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse66 v_arrayElimCell_152) .cse67)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse66 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse67))))))) (.cse2 (or .cse25 (and (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse65 (+ v_arrayElimCell_151 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse65 (+ v_arrayElimCell_150 4)))))) .cse47))) (.cse6 (or .cse24 (forall ((v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_148) (+ v_arrayElimCell_150 4)))))) (.cse7 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse62 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse63 (+ v_arrayElimCell_151 4)) (.cse64 (select .cse62 v_arrayElimCell_148))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse62 v_arrayElimCell_152) .cse63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse64 .cse63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse64 (+ v_arrayElimCell_150 4)))))))) (.cse9 (or .cse25 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse61 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse60 (+ v_arrayElimCell_151 4)) (.cse59 (select .cse61 v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse59 .cse60)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse61 v_arrayElimCell_148) .cse60)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse59 (+ v_arrayElimCell_150 4))))))))) (.cse11 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse58 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse55 (+ v_arrayElimCell_151 4)) (.cse56 (select .cse58 v_arrayElimCell_148)) (.cse54 (select .cse58 v_arrayElimCell_152)) (.cse57 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse54 .cse55)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse56 .cse55)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse56 .cse57)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse54 .cse57))))))) (.cse12 (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse52 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069)) (.cse53 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 v_arrayElimCell_152) .cse53)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 v_arrayElimCell_148) .cse53))))) .cse25)) (.cse17 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse49 (select .cse51 v_arrayElimCell_152)) (.cse50 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse49 .cse50)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse49 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse51 v_arrayElimCell_148) .cse50)))))) .cse25)) (.cse1 (or (and .cse47 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse48 (+ v_arrayElimCell_151 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse48 .cse17)))))) .cse25)) (.cse5 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse43 (select .cse46 v_arrayElimCell_152)) (.cse44 (+ v_arrayElimCell_151 4)) (.cse45 (select .cse46 v_arrayElimCell_148))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse43 .cse44)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse43 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse44)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse17))))))) (.cse8 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse41 (+ v_arrayElimCell_151 4)) (.cse42 (select .cse40 v_arrayElimCell_148))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse40 v_arrayElimCell_152) .cse41)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 .cse41)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 .cse17))))))) (.cse4 (and .cse2 .cse6 .cse7 .cse9 .cse11 .cse12)) (.cse10 (or .cse24 (forall ((v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_148) .cse17))))) (.cse13 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (and (or .cse25 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse30 (+ v_arrayElimCell_151 4)) (.cse29 (select .cse31 v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 .cse30)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse31 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse30)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ v_arrayElimCell_150 4)))))))) (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse32 (select .cse36 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse35 (+ v_arrayElimCell_151 4)) (.cse34 (select .cse36 v_arrayElimCell_152)) (.cse33 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 .cse33)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 .cse35)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 .cse35)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 .cse33)))))) .cse2 .cse15 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse39 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse38 v_arrayElimCell_152) .cse39)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 .cse39)))))) (or .cse24 (forall ((v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_150 4)))))))) (and (or (and .cse0 .cse1 .cse2 (or .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) .cse1 (or .cse14 .cse3) .cse15 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse19 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_152) .cse19)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse19)))))) (or .cse3 (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (or .cse13 .cse4) .cse10 .cse11 .cse12)) (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse20 (select .cse23 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse22 (+ v_arrayElimCell_151 4)) (.cse21 (select .cse23 v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 .cse22)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse22)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 .cse17)))))) (or .cse24 (forall ((v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse17)))) (or .cse13 .cse14) (or .cse25 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse27 (+ v_arrayElimCell_151 4)) (.cse26 (select .cse28 v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse27)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse27)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse17)))))))))))) is different from false [2022-11-16 12:37:13,020 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse25 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse30 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152) (+ v_arrayElimCell_151 4))))) (.cse23 (not .cse25))) (let ((.cse0 (or .cse23 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069)) (.cse68 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse67 v_arrayElimCell_152) .cse68)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse67 v_arrayElimCell_148) .cse68))))))) (.cse2 (or .cse23 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse66 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse65 (+ v_arrayElimCell_151 4)) (.cse64 (select .cse66 v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse64 .cse65)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse66 v_arrayElimCell_148) .cse65)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse64 (+ v_arrayElimCell_150 4))))))))) (.cse4 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse63 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse60 (+ v_arrayElimCell_151 4)) (.cse61 (select .cse63 v_arrayElimCell_148)) (.cse59 (select .cse63 v_arrayElimCell_152)) (.cse62 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse59 .cse60)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse61 .cse60)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse61 .cse62)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse59 .cse62))))))) (.cse8 (or .cse25 (forall ((v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_148) (+ v_arrayElimCell_150 4)))))) (.cse11 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse57 (+ v_arrayElimCell_151 4)) (.cse58 (select .cse56 v_arrayElimCell_148))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse56 v_arrayElimCell_152) .cse57)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse58 .cse57)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse58 (+ v_arrayElimCell_150 4)))))))) (.cse17 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse24 (or .cse23 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069)) (.cse55 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse54 v_arrayElimCell_152) .cse55)) (= (select (select .cse54 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse55) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse12 (or (and (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse53 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 (+ v_arrayElimCell_151 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 (+ v_arrayElimCell_150 4)))))) .cse30) .cse23))) (let ((.cse19 (and (or .cse23 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse42 (select .cse44 v_arrayElimCell_152)) (.cse43 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 .cse43)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 (+ v_arrayElimCell_150 4))) (= (select (select .cse44 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse43) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse45 (select .cse49 v_arrayElimCell_152)) (.cse48 (+ v_arrayElimCell_150 4)) (.cse47 (select .cse49 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse46 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse46)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse47 .cse48)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse48)) (= (select .cse47 .cse46) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse52 (select .cse50 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse51 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse50 v_arrayElimCell_152) .cse51)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse52 (+ v_arrayElimCell_150 4))) (= (select .cse52 .cse51) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse24 (or .cse25 (forall ((v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_150 4))))) .cse12)) (.cse1 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse41 (select .cse39 v_arrayElimCell_148)) (.cse40 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse39 v_arrayElimCell_152) .cse40)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 .cse40))))))) (.cse3 (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse36 (select .cse38 v_arrayElimCell_152)) (.cse37 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 .cse37)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse38 v_arrayElimCell_148) .cse37)))))) .cse23)) (.cse9 (and .cse0 .cse2 .cse4 .cse8 .cse11 .cse12)) (.cse13 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse32 (select .cse35 v_arrayElimCell_152)) (.cse34 (select .cse35 v_arrayElimCell_148)) (.cse33 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 .cse33)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 .cse33))))))) (.cse6 (or (and .cse30 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ v_arrayElimCell_151 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 .cse17)))))) .cse23)) (.cse7 (or .cse25 (forall ((v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_148) .cse17))))) (.cse10 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or .cse9 .cse10) .cse11 .cse12) .cse13) (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse16 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse15 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_152) .cse15)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse17)) (= (select .cse16 .cse15) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse10 .cse19) (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse20 (select .cse22 v_arrayElimCell_152)) (.cse21 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse21)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse17)) (= (select (select .cse22 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse21) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse23) (or .cse13 .cse19) .cse24 .cse6 (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or .cse9 .cse13) .cse5 .cse6 .cse7 .cse8 .cse11 .cse12) .cse10) (or .cse25 (forall ((v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse17)))) (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse26 (select .cse29 v_arrayElimCell_152)) (.cse28 (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse27 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse27)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 .cse17)) (= (select .cse28 .cse27) |c_ULTIMATE.start_main_~uneq~0#1|)))))))))) is different from false [2022-11-16 12:39:18,396 WARN L233 SmtUtils]: Spent 1.87m on a formula simplification. DAG size of input: 117 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:39:25,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse2))) (or (not (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse2)))) (and (= .cse2 0) (= .cse0 0)) (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (forall ((v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) .cse1 v_ArrVal_3069) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse4))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) .cse1 v_ArrVal_3069))) (let ((.cse7 (select .cse8 v_arrayElimCell_152)) (.cse6 (+ v_arrayElimCell_151 4)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 .cse6)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 .cse4)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 .cse6)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 .cse4)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) .cse1 v_ArrVal_3069))) (let ((.cse10 (+ v_arrayElimCell_151 4)) (.cse9 (select .cse11 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 .cse10)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_152) .cse10)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 .cse4))))))))))) is different from false [2022-11-16 12:39:25,247 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse10) .cse11))) (or (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (and (forall ((v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) .cse1 v_ArrVal_3069) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse2))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) .cse1 v_ArrVal_3069))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse5 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse3 .cse2)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse4 v_arrayElimCell_152) .cse5)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse3 .cse5)))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) .cse1 v_ArrVal_3069))) (let ((.cse7 (select .cse9 v_arrayElimCell_152)) (.cse6 (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse8 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse6 .cse2)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 .cse8)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 .cse2)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse6 .cse8)))))) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (not (= .cse10 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| .cse10) .cse11)))) (and (= .cse11 0) (= .cse10 0))))) is different from false [2022-11-16 12:39:25,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:25,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 546 treesize of output 534 [2022-11-16 12:39:25,554 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-16 12:39:25,554 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 2209 treesize of output 2207 [2022-11-16 12:39:25,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:25,605 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 2181 treesize of output 2102 [2022-11-16 12:39:25,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:25,646 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 2093 treesize of output 2058 [2022-11-16 12:39:25,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:25,692 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 2056 treesize of output 2034 [2022-11-16 12:39:25,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 2021 treesize of output 2017 [2022-11-16 12:39:25,765 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 2017 treesize of output 2015 [2022-11-16 12:39:25,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:25,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2643 treesize of output 2655 [2022-11-16 12:39:25,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:25,897 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 2615 treesize of output 2600 [2022-11-16 12:39:25,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:25,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2591 treesize of output 2588 [2022-11-16 12:39:26,675 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 526 treesize of output 522 [2022-11-16 12:39:27,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 12:39:29,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168239490] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:39:29,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:29,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 65 [2022-11-16 12:39:29,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33120245] [2022-11-16 12:39:29,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:29,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-16 12:39:29,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:29,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-16 12:39:29,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=5620, Unknown=5, NotChecked=770, Total=6642 [2022-11-16 12:39:29,727 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 65 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 56 states have internal predecessors, (99), 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-16 12:39:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:37,417 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-11-16 12:39:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 12:39:37,418 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 56 states have internal predecessors, (99), 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 59 [2022-11-16 12:39:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:37,419 INFO L225 Difference]: With dead ends: 92 [2022-11-16 12:39:37,419 INFO L226 Difference]: Without dead ends: 92 [2022-11-16 12:39:37,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 142.8s TimeCoverageRelationStatistics Valid=582, Invalid=10563, Unknown=5, NotChecked=1060, Total=12210 [2022-11-16 12:39:37,422 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 338 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:37,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1563 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1889 Invalid, 0 Unknown, 10 Unchecked, 1.8s Time] [2022-11-16 12:39:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-16 12:39:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-16 12:39:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.25) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 12:39:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-11-16 12:39:37,425 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 59 [2022-11-16 12:39:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:37,425 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-11-16 12:39:37,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 56 states have internal predecessors, (99), 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-16 12:39:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-11-16 12:39:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-16 12:39:37,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:37,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:37,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:37,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-16 12:39:37,632 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-16 12:39:37,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash -205595639, now seen corresponding path program 1 times [2022-11-16 12:39:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:37,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634138516] [2022-11-16 12:39:37,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:39,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:39:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:39:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:40,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:39:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:39:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:41,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634138516] [2022-11-16 12:39:41,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634138516] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:39:41,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611242892] [2022-11-16 12:39:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:41,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:41,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:41,149 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:39:41,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_481ff3b3-f60f-41a2-9b55-79feb86cb877/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 12:39:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:41,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-16 12:39:41,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:41,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:39:41,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:39:41,656 WARN L855 $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_3275 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3275))))) is different from true [2022-11-16 12:39:41,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:41,697 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-16 12:39:41,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:39:41,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:41,996 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-16 12:39:42,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:39:42,510 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-16 12:39:42,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:39:43,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:43,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:39:43,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:43,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-16 12:39:44,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:44,027 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 19 treesize of output 23 [2022-11-16 12:39:44,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:44,212 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 13 treesize of output 17 [2022-11-16 12:39:44,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:44,621 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 20 [2022-11-16 12:39:44,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:44,875 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-16 12:39:44,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:39:45,117 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-16 12:39:45,118 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 51 treesize of output 56 [2022-11-16 12:39:45,147 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 12:39:45,147 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 54 treesize of output 41 [2022-11-16 12:39:45,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:39:45,610 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:39:45,611 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 43 treesize of output 23 [2022-11-16 12:39:46,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:39:46,030 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-11-16 12:39:46,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 33 [2022-11-16 12:39:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-16 12:39:46,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:46,249 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 302 treesize of output 298 [2022-11-16 12:39:48,298 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (= (select |c_#valid| (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) 1))) (or (and (or (not .cse0) (not .cse1)) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (and (or (not .cse2) (not .cse3)) (forall ((v_arrayElimCell_195 Int)) (= (select |c_#valid| (select .cse4 v_arrayElimCell_195)) 1))) (and .cse3 .cse2 .cse5)))) (and .cse0 .cse1 .cse5)))) is different from false [2022-11-16 12:40:09,113 WARN L233 SmtUtils]: Spent 10.79s on a formula simplification. DAG size of input: 61 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:40:22,455 WARN L233 SmtUtils]: Spent 12.24s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:40:35,418 WARN L233 SmtUtils]: Spent 12.29s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:40:46,135 WARN L233 SmtUtils]: Spent 10.20s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:40:55,034 INFO L321 Elim1Store]: treesize reduction 990, result has 47.9 percent of original size [2022-11-16 12:40:55,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 22 new quantified variables, introduced 190 case distinctions, treesize of input 99448 treesize of output 85127 [2022-11-16 12:41:00,958 WARN L233 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 1703 DAG size of output: 1678 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)